oj.uz

답안 #831971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831971 2023-08-20T18:53:35 Z NK_ Grapevine (NOI22_grapevine) C++17
68 / 100
 1571 ms 1048576 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int nax = 1e5 + 5;
const int LG = 17;
const int MEM = 1e7;

// START OF SEGTREE
struct Seg {
	const ll ID = INFL, IDL = 0; ll comb(ll a, ll b) { return min(a, b); }
	int n; ll *seg, *lazy;
	void init(int N) {
		n = 1; while(n < N) n *= 2;
		seg = new ll[2*n];
		lazy = new ll[2*n];
		for(int i = 0; i < 2*n; i++) {
			seg[i] = ID, lazy[i] = IDL;
		}
	}
 
	void pull(int x) { seg[x] = comb(seg[2*x], seg[2*x+1]); } 
 
	void push(int x, int L, int R) {
		seg[x] += lazy[x];
		if (L != R) for(int i = 0; i < 2; i++) lazy[2*x+i] += lazy[x];
		lazy[x] = IDL;
	}
 
	void upd(int l, int r, ll v, int x, int L, int R) {
		push(x, L, R); if (r < L || R < l) return;
		if (l <= L && R <= r) {
			lazy[x] = v; push(x, L, R); return;
		}
		int M = (L + R) / 2;
		upd(l, r, v, 2*x, L, M);
		upd(l, r, v, 2*x+1, M+1, R);
		pull(x);
	}
 
	ll query(int l, int r, int x, int L, int R) {
		push(x, L, R); if (r < L || R < l) return 2 * ID;
		if (l <= L && R <= r) return seg[x];
		int M = (L + R) / 2;
		return comb(query(l, r, 2*x, L, M), query(l, r, 2*x+1, M+1, R));
	}
 
	void upd(int l, int r, ll v) { upd(l, r, v, 1, 0, n - 1); }
	ll query(int l, int r) { return query(l, r, 1, 0, n - 1); }
	ll query() { return seg[1]; }
};
// END OF SEGTREE
 
 
 
// MAIN
vpi adj[nax]; int W[nax];
 
// CENTROID
int sub[nax], proc[nax], siz[nax];
 
// CENTROID SUBTREES
int eid[nax][LG], st[nax][LG], en[nax][LG], par[nax][LG];
Seg T[nax];
// __[u][t] = a property of the subtree rooted at u's t-th parent in the centroid tree
 
// START OF CENTROID
void gen(int u, int p = -1) {
	sub[u] = 1;
	for(auto& e : adj[u]) {
		int v, i; tie(v, i) = e;
		if (v != p && !proc[v]) {
			gen(v, u); sub[u] += sub[v];
		}
	}
}
 
int t = 0, C = -1;
int LVL = 0;
void dfs(int u, int p = -1) {
	par[u][LVL] = C; st[u][LVL] = t++;
	for(auto& e : adj[u]) {
		int v, i; tie(v, i) = e;
		if (v != p && !proc[v]) {
			eid[v][LVL] = i;
			dfs(v, u); sub[u] += sub[v];
		}
	}
	en[u][LVL] = t - 1;
}
 
int find(int u, int n, int p = -1) {
	for(auto& e : adj[u]) {
		int v, i; tie(v, i) = e;
		if (v != p && !proc[v]) {
			if (2 * sub[v] > n) return find(v, n, u);
		}
	}
	return u;
}
 
int init(int u = 0) {
	gen(u); int c = find(u, sub[u]);
 
	t = 0, C = c, eid[c][LVL] = -1; dfs(c);
	proc[c] = 1;
 
	siz[c] = sub[u];
	assert(t <= siz[c]);
	T[c].init(siz[c]);
 
	for(auto& e : adj[c]) {
		int v, i; tie(v, i) = e;
		if (!proc[v]) {
			++LVL; init(v); --LVL;
		}
	}
 
	return c;
}
// END OF CENTROID
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	memset(par, -1, sizeof(par));
 
	int N, Q; cin >> N >> Q;
 
	unordered_map<ll, int> E;
	for(int i = 0; i < N - 1; i++) {
		int u, v; cin >> u >> v >> W[i]; --u, --v;
		adj[u].pb(mp(v, i));
		adj[v].pb(mp(u, i));
		E[u * 1LL * N + v] = E[v * 1LL * N + u] = i;
	}
 
	int R = init();
 
	for(int u = 0; u < N; u++) {
		for(int p = 0; p < LG; p++) {
			int e = eid[u][p], x = par[u][p]; if (x == -1) continue;
			if (e != -1) T[x].upd(st[u][p], en[u][p], W[e]);
		}
	}
 
	for(int q = 0; q < Q; q++) {
		int type; cin >> type;
 
		if (type == 1) {
			int u; cin >> u; --u;
			
			ll ans = 2 * INFL;
 
			for(int p = 0; p < LG; p++) {
				int x = par[u][p], pos = st[u][p]; 
 				if (x == -1) continue;
 
				ll dst = T[x].query(pos, pos);
				if (dst >= INFL) dst -= INFL;
 
				ans = min(ans, dst + T[x].query());
			}
			cout << (ans >= INFL ? -1 : ans) << nl;
		}
 
		if (type == 2) {
			int u; cin >> u; --u;
			for(int p = 0; p < LG; p++) {
				int x = par[u][p], pos = st[u][p]; 
 				if (x == -1) continue;
 
				if (T[x].query(pos, pos) >= INFL) T[x].upd(pos, pos, -INFL);
				else T[x].upd(pos, pos, +INFL);
			}
		}
 
		if (type == 3) {
			int u, v, w; cin >> u >> v >> w; --u, --v;
 
			int i = E[u * 1LL * N + v];
 
			for(int rep = 0; rep < 2; rep++) {
				for(int p = 0; p < LG; p++) {
					int x = par[u][p], e = eid[u][p]; if (x == -1) continue;
 
					if (e == i) T[x].upd(st[u][p], en[u][p], w - W[i]);
				}
 
				swap(u, v);
			}
 
			W[i] = w;
		}
 
	}
 
 
 
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:164:6: warning: unused variable 'R' [-Wunused-variable]
  164 |  int R = init();
      |      ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14804 KB Output is correct
2 Correct 12 ms 14788 KB Output is correct
3 Correct 17 ms 14792 KB Output is correct
4 Correct 13 ms 14796 KB Output is correct
5 Correct 12 ms 14796 KB Output is correct
6 Correct 12 ms 14804 KB Output is correct
7 Correct 7 ms 14164 KB Output is correct
8 Correct 7 ms 14164 KB Output is correct
9 Correct 8 ms 14156 KB Output is correct
10 Correct 12 ms 14920 KB Output is correct
11 Correct 12 ms 14792 KB Output is correct
12 Correct 13 ms 14924 KB Output is correct
13 Correct 8 ms 14160 KB Output is correct
14 Correct 8 ms 14164 KB Output is correct
15 Correct 9 ms 14180 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1154 ms 112460 KB Output is correct
2 Correct 1180 ms 114604 KB Output is correct
3 Correct 1245 ms 113768 KB Output is correct
4 Correct 981 ms 122144 KB Output is correct
5 Correct 941 ms 114804 KB Output is correct
6 Correct 961 ms 117188 KB Output is correct
7 Correct 201 ms 63332 KB Output is correct
8 Correct 181 ms 62384 KB Output is correct
9 Correct 180 ms 62360 KB Output is correct
10 Correct 976 ms 119260 KB Output is correct
11 Correct 918 ms 117716 KB Output is correct
12 Correct 947 ms 120724 KB Output is correct
13 Correct 176 ms 62564 KB Output is correct
14 Correct 178 ms 62548 KB Output is correct
15 Correct 181 ms 63004 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1443 ms 523260 KB Output is correct
2 Correct 1442 ms 526056 KB Output is correct
3 Correct 1446 ms 527264 KB Output is correct
4 Correct 1456 ms 503656 KB Output is correct
5 Correct 1571 ms 505360 KB Output is correct
6 Correct 1399 ms 502260 KB Output is correct
7 Correct 1366 ms 501332 KB Output is correct
8 Correct 1458 ms 523048 KB Output is correct
9 Correct 1446 ms 502640 KB Output is correct
10 Correct 1446 ms 526348 KB Output is correct
11 Correct 1479 ms 504256 KB Output is correct
12 Correct 1412 ms 499356 KB Output is correct
13 Correct 1418 ms 523204 KB Output is correct
14 Correct 1473 ms 499280 KB Output is correct
15 Correct 1431 ms 504360 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1308 ms 122380 KB Output is correct
2 Correct 1337 ms 128056 KB Output is correct
3 Correct 1287 ms 111500 KB Output is correct
4 Correct 1101 ms 122588 KB Output is correct
5 Correct 1151 ms 118780 KB Output is correct
6 Correct 1114 ms 120060 KB Output is correct
7 Correct 212 ms 62740 KB Output is correct
8 Correct 195 ms 63620 KB Output is correct
9 Correct 207 ms 62800 KB Output is correct
10 Correct 1138 ms 135624 KB Output is correct
11 Correct 1089 ms 116752 KB Output is correct
12 Correct 1077 ms 120696 KB Output is correct
13 Correct 188 ms 62500 KB Output is correct
14 Correct 199 ms 63808 KB Output is correct
15 Correct 196 ms 63024 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1353 ms 120888 KB Output is correct
2 Correct 1310 ms 123832 KB Output is correct
3 Correct 1273 ms 117872 KB Output is correct
4 Correct 1052 ms 124104 KB Output is correct
5 Correct 1119 ms 123360 KB Output is correct
6 Correct 1097 ms 120308 KB Output is correct
7 Correct 187 ms 62696 KB Output is correct
8 Correct 189 ms 63208 KB Output is correct
9 Correct 194 ms 63452 KB Output is correct
10 Correct 1012 ms 114232 KB Output is correct
11 Correct 1043 ms 118012 KB Output is correct
12 Correct 1035 ms 129148 KB Output is correct
13 Correct 206 ms 63324 KB Output is correct
14 Correct 186 ms 62692 KB Output is correct
15 Correct 199 ms 62816 KB Output is correct

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 14804 KB Output is correct
2 Correct 12 ms 14788 KB Output is correct
3 Correct 17 ms 14792 KB Output is correct
4 Correct 13 ms 14796 KB Output is correct
5 Correct 12 ms 14796 KB Output is correct
6 Correct 12 ms 14804 KB Output is correct
7 Correct 7 ms 14164 KB Output is correct
8 Correct 7 ms 14164 KB Output is correct
9 Correct 8 ms 14156 KB Output is correct
10 Correct 12 ms 14920 KB Output is correct
11 Correct 12 ms 14792 KB Output is correct
12 Correct 13 ms 14924 KB Output is correct
13 Correct 8 ms 14160 KB Output is correct
14 Correct 8 ms 14164 KB Output is correct
15 Correct 9 ms 14180 KB Output is correct
16 Correct 1154 ms 112460 KB Output is correct
17 Correct 1180 ms 114604 KB Output is correct
18 Correct 1245 ms 113768 KB Output is correct
19 Correct 981 ms 122144 KB Output is correct
20 Correct 941 ms 114804 KB Output is correct
21 Correct 961 ms 117188 KB Output is correct
22 Correct 201 ms 63332 KB Output is correct
23 Correct 181 ms 62384 KB Output is correct
24 Correct 180 ms 62360 KB Output is correct
25 Correct 976 ms 119260 KB Output is correct
26 Correct 918 ms 117716 KB Output is correct
27 Correct 947 ms 120724 KB Output is correct
28 Correct 176 ms 62564 KB Output is correct
29 Correct 178 ms 62548 KB Output is correct
30 Correct 181 ms 63004 KB Output is correct
31 Correct 1443 ms 523260 KB Output is correct
32 Correct 1442 ms 526056 KB Output is correct
33 Correct 1446 ms 527264 KB Output is correct
34 Correct 1456 ms 503656 KB Output is correct
35 Correct 1571 ms 505360 KB Output is correct
36 Correct 1399 ms 502260 KB Output is correct
37 Correct 1366 ms 501332 KB Output is correct
38 Correct 1458 ms 523048 KB Output is correct
39 Correct 1446 ms 502640 KB Output is correct
40 Correct 1446 ms 526348 KB Output is correct
41 Correct 1479 ms 504256 KB Output is correct
42 Correct 1412 ms 499356 KB Output is correct
43 Correct 1418 ms 523204 KB Output is correct
44 Correct 1473 ms 499280 KB Output is correct
45 Correct 1431 ms 504360 KB Output is correct
46 Correct 1308 ms 122380 KB Output is correct
47 Correct 1337 ms 128056 KB Output is correct
48 Correct 1287 ms 111500 KB Output is correct
49 Correct 1101 ms 122588 KB Output is correct
50 Correct 1151 ms 118780 KB Output is correct
51 Correct 1114 ms 120060 KB Output is correct
52 Correct 212 ms 62740 KB Output is correct
53 Correct 195 ms 63620 KB Output is correct
54 Correct 207 ms 62800 KB Output is correct
55 Correct 1138 ms 135624 KB Output is correct
56 Correct 1089 ms 116752 KB Output is correct
57 Correct 1077 ms 120696 KB Output is correct
58 Correct 188 ms 62500 KB Output is correct
59 Correct 199 ms 63808 KB Output is correct
60 Correct 196 ms 63024 KB Output is correct
61 Correct 1353 ms 120888 KB Output is correct
62 Correct 1310 ms 123832 KB Output is correct
63 Correct 1273 ms 117872 KB Output is correct
64 Correct 1052 ms 124104 KB Output is correct
65 Correct 1119 ms 123360 KB Output is correct
66 Correct 1097 ms 120308 KB Output is correct
67 Correct 187 ms 62696 KB Output is correct
68 Correct 189 ms 63208 KB Output is correct
69 Correct 194 ms 63452 KB Output is correct
70 Correct 1012 ms 114232 KB Output is correct
71 Correct 1043 ms 118012 KB Output is correct
72 Correct 1035 ms 129148 KB Output is correct
73 Correct 206 ms 63324 KB Output is correct
74 Correct 186 ms 62692 KB Output is correct
75 Correct 199 ms 62816 KB Output is correct
76 Correct 6 ms 13248 KB Output is correct
77 Correct 5 ms 13268 KB Output is correct
78 Correct 5 ms 13268 KB Output is correct
79 Correct 1254 ms 112944 KB Output is correct
80 Correct 1355 ms 127636 KB Output is correct
81 Correct 1364 ms 116616 KB Output is correct
82 Correct 1089 ms 117520 KB Output is correct
83 Correct 1104 ms 119288 KB Output is correct
84 Correct 1142 ms 127444 KB Output is correct
85 Correct 201 ms 63788 KB Output is correct
86 Correct 227 ms 63468 KB Output is correct
87 Correct 201 ms 62496 KB Output is correct
88 Correct 1108 ms 132488 KB Output is correct
89 Runtime error 453 ms 1048576 KB Execution killed with signal 9
90 Halted 0 ms 0 KB -