oj.uz

답안 #619319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619319 2022-08-02T11:08:03 Z maximath_1 Dynamic Diameter (CEOI19_diameter) C++11
49 / 100
 5000 ms 109392 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int MX = 1e5 + 69;
const int LG = 17;
const ll inf = 4e18 + 69;
#define ll long long
int n, q; ll wtwtwt;
vector<pair<pair<int, int>, ll> > edges;
vector<int> adj[MX];

struct SegmentTree{
	ll st[MX * 2], lz[MX * 2];

	#define cm (cl + cr) / 2
	#define lc nd + 1
	#define rc nd + 2 * (cm - cl + 1)

	void prop(int nd, int cl, int cr){
		if(lz[nd]){
			st[nd] += lz[nd];
			if(cl != cr){
				lz[lc] += lz[nd];
				lz[rc] += lz[nd];
			}
			lz[nd] = 0;
		}
	}

	void upd(int nd, int cl, int cr, int lf, int rg, ll vl){
		prop(nd, cl, cr);
		if(cr < lf || rg < cl) return;
		if(lf <= cl && cr <= rg){
			lz[nd] += vl;
			prop(nd, cl, cr);
			return;
		}

		upd(lc, cl, cm, lf, rg, vl);
		upd(rc, cm + 1, cr, lf, rg, vl);
		st[nd] = max(st[lc], st[rc]);
	}

	ll que(int nd, int cl, int cr, int lf, int rg){
		prop(nd, cl, cr);
		if(cr < lf || rg < cl) return -1;
		if(lf <= cl && cr <= rg) return st[nd];
		ll L = que(lc, cl, cm, lf, rg);
		ll R = que(rc, cm + 1, cr, lf, rg);
		return max(L, R);
	}
} st[LG];

struct SegmentTreeIterative{
	ll st[MX << 1];

	void upd(int ps, ll vl){
		for(ps += MX, st[ps] = vl, ps >>= 1; ps > 0; ps >>= 1) st[ps] = max(st[ps << 1], st[ps << 1 | 1]);
	}

	ll que(ll lf, ll rg){
		ll rs = 0ll;
		for(lf += MX, rg += MX + 1; lf < rg; lf >>= 1, rg >>= 1){
			if(lf & 1) rs = max(st[lf ++], rs);
			if(rg & 1) rs = max(rs, st[-- rg]);
		}
		return rs;
	}
} stdp;

bool vis[MX], dead[MX];
int sz[MX];
void dfssz(int nw, int bf){
	sz[nw] = 1;
	for(int nx : adj[nw]) if(nx != bf && !dead[nx]){
		dfssz(nx, nw);
		sz[nw] += sz[nx];
	}
}

int cent = -1, ccsz = 0;
void dfscent(int nw, int bf){
	for(int nx : adj[nw]) if(nx != bf && !dead[nx]) dfscent(nx, nw);
	if(cent == -1 && sz[nw] >= (ccsz + 1) / 2) cent = nw;
}

int layer = 0, tin[MX][LG], tim[LG], tout[MX][LG], rt[MX][LG], par[MX][LG], layer_id[MX];
void init(int nw, int bf){
	rt[nw][layer] = cent;
	tin[nw][layer] = ++ tim[layer];
	par[nw][layer] = bf;
	for(int nx : adj[nw]) if(nx != bf && !dead[nx]) init(nx, nw);
	tout[nw][layer] = tim[layer];
}

vector<pair<int, int> > adj_root[MX];

void findCentroid(int nw){
	dfssz(nw, 0);
	cent = -1, ccsz = sz[nw];
	dfscent(nw, 0);

	init(cent, 0); layer_id[cent] = layer;
	for(int nx : adj[cent]) if(!dead[nx])
		adj_root[cent].push_back({tin[nx][layer], nx});
	sort(adj_root[cent].begin(), adj_root[cent].end());

	dead[cent] = 1;
	for(int nx : adj[cent]) if(!dead[nx]){
		layer ++;
		findCentroid(nx);
		layer --;
	}
}

set<pair<ll, int> > dp[MX];

int main(){
	scanf("%d %d %lld", &n, &q, &wtwtwt);
	for(int i = 1; i < n; i ++){
		int u, v; ll w;
		scanf("%d %d %lld", &u, &v, &w);
		adj[u].push_back(v);
		adj[v].push_back(u);
		edges.push_back({{u, v}, w});
	}

	findCentroid(1);

	for(auto e : edges){
		int u = e.first.first, v = e.first.second; ll w = e.second;
		for(int j = 0; j < LG; j ++){
			if(rt[u][j] != rt[v][j]) break;
			if(tin[u][j] < tin[v][j]) swap(u, v);
			st[j].upd(1, 1, n, tin[u][j], tout[u][j], w);
		}
	}

	for(int i = 1; i <= n; i ++){
		for(pair<int, int> nx : adj_root[i])
			dp[i].insert({st[layer_id[i]].que(1, 1, n, tin[nx.second][layer_id[i]], tout[nx.second][layer_id[i]]), tin[nx.second][layer_id[i]]});

		ll res = 0ll;
		auto it = dp[i].end();
		for(int _ = 0; _ < 2; _ ++) if(it != dp[i].begin()){
			it = prev(it);
			res += (*it).first;
		}

		stdp.upd(i, res);
	}

	ll last_answer = 0ll;
	for(; q --;){
		int ee; ll wt; scanf("%d %lld", &ee, &wt);
		ee = (int)((ee + last_answer) % (n - 1));
		wt = (wt + last_answer) % wtwtwt;

		int u = edges[ee].first.first, v = edges[ee].first.second; ll wtchange = wt - edges[ee].second;

		for(int j = 0; j < LG; j ++){
			if(rt[u][j] != rt[v][j]) break;
			if(tin[u][j] < tin[v][j]) swap(u, v);
			int uid = lower_bound(adj_root[rt[u][j]].begin(), adj_root[rt[u][j]].end(), make_pair(tin[u][j] + 1, -1)) - adj_root[rt[u][j]].begin();
			int anc = adj_root[rt[u][j]][uid - 1].second;

			dp[rt[u][j]].erase(make_pair(st[j].que(1, 1, n, tin[anc][j], tout[anc][j]), tin[anc][j]));
			st[j].upd(1, 1, n, tin[u][j], tout[u][j], wtchange);
			dp[rt[u][j]].insert(make_pair(st[j].que(1, 1, n, tin[anc][j], tout[anc][j]), tin[anc][j]));

			ll res = 0ll;
			auto it = dp[rt[u][j]].end();
			for(int _ = 0; _ < 2; _ ++) if(it != dp[rt[u][j]].begin()){
				it = prev(it);
				res += (*it).first;
			}

			stdp.upd(rt[u][j], res);
		}

		edges[ee].second = wt;

		last_answer = stdp.que(1, n);
		printf("%lld\n", last_answer);
	}

	return 0;
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:120:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |  scanf("%d %d %lld", &n, &q, &wtwtwt);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:123:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |   scanf("%d %d %lld", &u, &v, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:156:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  156 |   int ee; ll wt; scanf("%d %lld", &ee, &wt);
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 6 ms 9792 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 5 ms 9836 KB Output is correct
13 Correct 5 ms 9900 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 5 ms 9812 KB Output is correct
16 Correct 5 ms 9812 KB Output is correct
17 Correct 6 ms 9932 KB Output is correct
18 Correct 5 ms 9812 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 6 ms 9792 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 5 ms 9836 KB Output is correct
13 Correct 5 ms 9900 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 5 ms 9812 KB Output is correct
16 Correct 5 ms 9812 KB Output is correct
17 Correct 6 ms 9932 KB Output is correct
18 Correct 5 ms 9812 KB Output is correct
19 Correct 24 ms 10508 KB Output is correct
20 Correct 28 ms 10528 KB Output is correct
21 Correct 31 ms 10588 KB Output is correct
22 Correct 36 ms 10640 KB Output is correct
23 Correct 58 ms 13068 KB Output is correct
24 Correct 60 ms 13424 KB Output is correct
25 Correct 64 ms 13668 KB Output is correct
26 Correct 83 ms 14184 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9816 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 7 ms 9812 KB Output is correct
4 Correct 19 ms 9812 KB Output is correct
5 Correct 77 ms 10136 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9940 KB Output is correct
8 Correct 7 ms 9940 KB Output is correct
9 Correct 10 ms 10068 KB Output is correct
10 Correct 27 ms 10072 KB Output is correct
11 Correct 107 ms 10416 KB Output is correct
12 Correct 13 ms 11988 KB Output is correct
13 Correct 11 ms 11988 KB Output is correct
14 Correct 14 ms 12008 KB Output is correct
15 Correct 39 ms 12104 KB Output is correct
16 Correct 142 ms 12492 KB Output is correct
17 Correct 133 ms 54008 KB Output is correct
18 Correct 139 ms 54020 KB Output is correct
19 Correct 141 ms 53944 KB Output is correct
20 Correct 179 ms 54056 KB Output is correct
21 Correct 422 ms 54644 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 10452 KB Output is correct
2 Correct 46 ms 10568 KB Output is correct
3 Correct 172 ms 10916 KB Output is correct
4 Correct 389 ms 10956 KB Output is correct
5 Correct 43 ms 17436 KB Output is correct
6 Correct 94 ms 17456 KB Output is correct
7 Correct 336 ms 17752 KB Output is correct
8 Correct 636 ms 18212 KB Output is correct
9 Correct 241 ms 51456 KB Output is correct
10 Correct 350 ms 51468 KB Output is correct
11 Correct 746 ms 51860 KB Output is correct
12 Correct 1243 ms 52260 KB Output is correct
13 Correct 509 ms 96112 KB Output is correct
14 Correct 652 ms 96184 KB Output is correct
15 Correct 1103 ms 96400 KB Output is correct
16 Correct 1773 ms 96868 KB Output is correct
17 Correct 2942 ms 96884 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2853 ms 87296 KB Output is correct
2 Correct 2833 ms 88728 KB Output is correct
3 Correct 2750 ms 88192 KB Output is correct
4 Correct 2842 ms 88448 KB Output is correct
5 Correct 2753 ms 85836 KB Output is correct
6 Correct 2289 ms 74332 KB Output is correct
7 Correct 4093 ms 101116 KB Output is correct
8 Correct 4193 ms 101376 KB Output is correct
9 Correct 3995 ms 101356 KB Output is correct
10 Correct 4096 ms 100992 KB Output is correct
11 Correct 4276 ms 98060 KB Output is correct
12 Correct 3256 ms 81468 KB Output is correct
13 Correct 4454 ms 109192 KB Output is correct
14 Correct 4178 ms 109260 KB Output is correct
15 Correct 4219 ms 109148 KB Output is correct
16 Correct 4682 ms 109000 KB Output is correct
17 Correct 4156 ms 104932 KB Output is correct
18 Correct 3265 ms 84060 KB Output is correct
19 Correct 4363 ms 109240 KB Output is correct
20 Correct 4295 ms 109280 KB Output is correct
21 Correct 4619 ms 109392 KB Output is correct
22 Execution timed out 5019 ms 108892 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9812 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9812 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 6 ms 9812 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 6 ms 9792 KB Output is correct
11 Correct 6 ms 9812 KB Output is correct
12 Correct 5 ms 9836 KB Output is correct
13 Correct 5 ms 9900 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 5 ms 9812 KB Output is correct
16 Correct 5 ms 9812 KB Output is correct
17 Correct 6 ms 9932 KB Output is correct
18 Correct 5 ms 9812 KB Output is correct
19 Correct 24 ms 10508 KB Output is correct
20 Correct 28 ms 10528 KB Output is correct
21 Correct 31 ms 10588 KB Output is correct
22 Correct 36 ms 10640 KB Output is correct
23 Correct 58 ms 13068 KB Output is correct
24 Correct 60 ms 13424 KB Output is correct
25 Correct 64 ms 13668 KB Output is correct
26 Correct 83 ms 14184 KB Output is correct
27 Correct 7 ms 9816 KB Output is correct
28 Correct 6 ms 9812 KB Output is correct
29 Correct 7 ms 9812 KB Output is correct
30 Correct 19 ms 9812 KB Output is correct
31 Correct 77 ms 10136 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9940 KB Output is correct
34 Correct 7 ms 9940 KB Output is correct
35 Correct 10 ms 10068 KB Output is correct
36 Correct 27 ms 10072 KB Output is correct
37 Correct 107 ms 10416 KB Output is correct
38 Correct 13 ms 11988 KB Output is correct
39 Correct 11 ms 11988 KB Output is correct
40 Correct 14 ms 12008 KB Output is correct
41 Correct 39 ms 12104 KB Output is correct
42 Correct 142 ms 12492 KB Output is correct
43 Correct 133 ms 54008 KB Output is correct
44 Correct 139 ms 54020 KB Output is correct
45 Correct 141 ms 53944 KB Output is correct
46 Correct 179 ms 54056 KB Output is correct
47 Correct 422 ms 54644 KB Output is correct
48 Correct 12 ms 10452 KB Output is correct
49 Correct 46 ms 10568 KB Output is correct
50 Correct 172 ms 10916 KB Output is correct
51 Correct 389 ms 10956 KB Output is correct
52 Correct 43 ms 17436 KB Output is correct
53 Correct 94 ms 17456 KB Output is correct
54 Correct 336 ms 17752 KB Output is correct
55 Correct 636 ms 18212 KB Output is correct
56 Correct 241 ms 51456 KB Output is correct
57 Correct 350 ms 51468 KB Output is correct
58 Correct 746 ms 51860 KB Output is correct
59 Correct 1243 ms 52260 KB Output is correct
60 Correct 509 ms 96112 KB Output is correct
61 Correct 652 ms 96184 KB Output is correct
62 Correct 1103 ms 96400 KB Output is correct
63 Correct 1773 ms 96868 KB Output is correct
64 Correct 2942 ms 96884 KB Output is correct
65 Correct 2853 ms 87296 KB Output is correct
66 Correct 2833 ms 88728 KB Output is correct
67 Correct 2750 ms 88192 KB Output is correct
68 Correct 2842 ms 88448 KB Output is correct
69 Correct 2753 ms 85836 KB Output is correct
70 Correct 2289 ms 74332 KB Output is correct
71 Correct 4093 ms 101116 KB Output is correct
72 Correct 4193 ms 101376 KB Output is correct
73 Correct 3995 ms 101356 KB Output is correct
74 Correct 4096 ms 100992 KB Output is correct
75 Correct 4276 ms 98060 KB Output is correct
76 Correct 3256 ms 81468 KB Output is correct
77 Correct 4454 ms 109192 KB Output is correct
78 Correct 4178 ms 109260 KB Output is correct
79 Correct 4219 ms 109148 KB Output is correct
80 Correct 4682 ms 109000 KB Output is correct
81 Correct 4156 ms 104932 KB Output is correct
82 Correct 3265 ms 84060 KB Output is correct
83 Correct 4363 ms 109240 KB Output is correct
84 Correct 4295 ms 109280 KB Output is correct
85 Correct 4619 ms 109392 KB Output is correct
86 Execution timed out 5019 ms 108892 KB Time limit exceeded
87 Halted 0 ms 0 KB -