結果

問題 No.1215 都市消滅ビーム
ユーザー heno239heno239
提出日時 2020-08-30 17:59:35
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 7,395 bytes
コンパイル時間 1,334 ms
コンパイル使用メモリ 131,892 KB
実行使用メモリ 10,016 KB
最終ジャッジ日時 2024-04-27 12:47:50
合計ジャッジ時間 16,226 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 -- -
testcase_02 -- -
testcase_03 -- -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In lambda function:
main.cpp:327:17: warning: no return statement in function returning non-void [-Wreturn-type]
  327 |                 };
      |                 ^
main.cpp: In lambda function:
main.cpp:328:9: warning: no return statement in function returning non-void [-Wreturn-type]
  328 |         };
      |         ^

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
struct lcagraph {
private:
	int n;
	vector<vector<int>> G;
	vector<vector<int>> parent;
	vector<int> depth;
	int root;
	int tmp;
public:
	lcagraph(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	lcagraph() {}
	void init(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		G[b].push_back(a);
	}
	void dfs(int id, int fr, int d) {
		parent[id][0] = fr;
		depth[id] = d;
		rep(j, G[id].size()) {
			int to = G[id][j];
			if (to == fr)continue;
			dfs(to, id, d + 1);
		}
	}
	void complete(int r = 0) {
		root = r;
		dfs(root, -1, 0);
		rep(j, tmp - 1)rep(i, n) {
			if (parent[i][j] < 0)parent[i][j + 1] = -1;
			else parent[i][j + 1] = parent[parent[i][j]][j];
		}
	}
	int lca(int u, int v) {
		if (depth[u] > depth[v])swap(u, v);
		for (int k = 0; k < tmp; k++) {
			if ((depth[v] - depth[u]) >> k & 1) {
				v = parent[v][k];
			}
		}
		if (u == v)return u;
		for (int k = tmp - 1; k >= 0; k--) {
			if (parent[u][k] != parent[v][k]) {
				u = parent[u][k];
				v = parent[v][k];
			}
		}
		return parent[u][0];
	}
	int dep(int x) {
		return depth[x];
	}
	int dist(int x, int y) {
		int l = lca(x, y);
		return depth[x] + depth[y] - 2 * depth[l];
	}
};

struct Node {
	Node* lch; Node* rch;
	int val = 0;
	int l, r;
	Node() {
		lch = NULL, rch = NULL;
		l = 0, r = (1 << 17);
		val = 0;
	}
	Node(int _l, int _r) {
		lch = NULL, rch = NULL;
		l = _l, r = _r;
		val = 0;
	}
};
void add(Node* nd,int loc) {
	while (true) {
		nd->val++;
		if (nd->r - nd->l == 1)break;
		int m = (nd->l + nd->r) / 2;
		if (loc < m) {
			if (nd->lch == NULL) {
				nd->lch = new Node(nd->l, m);
			}
			nd = nd->lch;
		}
		else {
			if (nd->rch == NULL) {
				nd->rch = new Node(m, nd->r);
			}
			nd = nd->rch;
		}
	}
}
int query(Node* nd, int b) {
	int res = 0;
	while (true) {
		if (nd->r - nd->l == 1) {
			res += nd->val; break;
		}
		int m = (nd->l + nd->r);
		if (m < b) {
			if (nd->lch != NULL)res += nd->lch->val;
			if (nd->rch == NULL)break;
			nd = nd->rch;
		}
		else {
			if (nd->lch == NULL)break;
			nd = nd->lch;
		}
	}
	return res;
}
void take_all(vector<int>& v, Node* nd) {
	if (nd->lch != NULL) {
		take_all(v, nd->lch);
	}
	if (nd->rch != NULL) {
		take_all(v, nd->rch);
	}
	if (nd->r - nd->l == 1) {
		v.push_back(nd->l);
	}
}

struct ste {
	Node* stle = new Node();Node* stri = new Node();
	int szle = 0, szri = 0;
};
void solve() {
	int n, k; cin >> n >> k;
	vector<vector<int>> G(n);
	vector<int> c(k); rep(i, k) {
		cin >> c[i]; c[i]--;
	}
	vector<ll> d(k); rep(i, k)cin >> d[i];
	lcagraph lg(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b); G[b].push_back(a);
		lg.add_edge(a, b);
	}
	lg.complete();
	vector<int> le(k + 1);
	vector<ll> lesum(k + 1);
	le[1] = c[1]; lesum[1] = d[1];
	for (int i = 2; i <= k; i++) {
		le[i] = lg.lca(le[i - 1], c[i]);
		lesum[i] = lesum[i - 1] + d[i];
	}
	vector<int> ri(k + 1);
	vector<ll> risum(k + 1);
	ri[1] = c.back(); risum[1] = d.back();
	for (int i = 2; i <= k; i++) {
		ri[i] = lg.lca(ri[i - 1], c[k - i]);
		risum[i] = risum[i - 1] + d[k - i];
	}
	vector<ll> vx;
	rep1(i, k)vx.push_back(lesum[i]);
	rep1(i, k)vx.push_back(risum[i]);
	sort(all(vx));
	vx.erase(unique(all(vx)), vx.end());
	rep1(i, k) {
		lesum[i] = lower_bound(all(vx), lesum[i]) - vx.begin();
		risum[i] = lower_bound(all(vx), risum[i]) - vx.begin();
	}
	vector<vector<int>> leids(n), riids(n);
	rep1(i, k-1) {
		leids[le[i]].push_back(i);
		riids[ri[i]].push_back(i);
	}
	auto calc = [&](ll x)->ll {
		ll res = 0;
		rep1(i, k) {
			ll val = lesum[i] + lg.dep(le[i]);
			if (val <= x)res++;
		}
		rep1(i, k - 1) {
			ll val = risum[i] + lg.dep(ri[i]);
			if (val <= x)res++;
		}vector<int> vl, vr;

		function<ste(int, int)> dfs = [&](int id, int fr)->ste{
			ste res;
			for (int i : leids[id]) {
				add(res.stle, lesum[i]);
				res.szle++;
			}
			for (int i : riids[id]) {
				add(res.stri, risum[i]);
				res.szri++;
			}
			for (int to : G[id])if (to != fr) {
				ste nex = dfs(to, id);
				if (res.szle + res.szri < nex.szle + nex.szri)swap(res, nex);
				vl.clear(); vr.clear();
				take_all(vl, nex.stle);
				take_all(vr, nex.stri);
			}
		};
	};
	ll l = -1000000000000000;
	ll r = -l;
	while (r - l > 1) {
		ll mid = (l + r) / 2;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}



//まにあわない
0