oj.uz

Submission #373733

# Submission time Handle Problem Language Result Execution time Memory
373733 2021-03-05T14:36:33 Z LucaDantas Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 2143 ms 17268 KB 
#include<bits/stdc++.h>
using namespace std;

constexpr int maxn = 2e5+10;

vector<pair<int,int>> g[maxn];

int n, q;
long long dist[maxn], cost[maxn], w;

void dfs(int u, int p) {
	for(auto [v, id] : g[u]) {
		if(v != p) {
			dist[v] = dist[u] + cost[id];
			dfs(v, u);
		}
	}
}

void brute() {
	int last = 0;
	while(q--) {
		int d, e; scanf("%d %d", &d, &e);
		d = (d + last) % (n - 1);
		e = (e + last) % w;
		cost[d] = e;
		dist[1] = 0;
		dfs(1, 0);
		int x = max_element(dist+1, dist+n+1) - dist;
		dist[x] = 0;
		dfs(x, 0);
		printf("%lld\n", *max_element(dist+1, dist+n+1));
		last = *max_element(dist+1, dist+n+1);
	}
	exit(0);
}

void bst() {
	multiset<long long, greater<long long>> st;
	for(int i = 0; i < n-1; i++)
		st.insert(cost[i]);
	int last = 0;
	while(q--) {
		int d, e; scanf("%d %d", &d, &e);
		d = (int)((d + last) % (n - 1));
		e = (int)((e + last) % w);
		st.erase(st.find(cost[d]));
		cost[d] = e;
		st.insert(e);
		last = (int)(*st.begin() + (n>2?*next(st.begin()):0));
		printf("%d\n", last);
	}
	exit(0);
}

int main() {
	scanf("%d %d %lld", &n, &q, &w);
	// printf("%d %d %lld\n", n, q, w);
	if(w > 10000) assert(0);
	for(int i = 0; i < n-1; i++) {
		int a, b; long long c; scanf("%d %d %lld", &a, &b, &c);
		// printf("%d %d %lld\n", a, b, c);
		g[a].push_back({b, i});
		g[b].push_back({a, i});
		cost[i] = c;
	}
	if((int)g[1].size() == n-1) bst();
	if(n <= 5000) brute();
}

Compilation message

diameter.cpp: In function 'void brute()':
diameter.cpp:23:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   int d, e; scanf("%d %d", &d, &e);
      |             ~~~~~^~~~~~~~~~~~~~~~~
diameter.cpp: In function 'void bst()':
diameter.cpp:44:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |   int d, e; scanf("%d %d", &d, &e);
      |             ~~~~~^~~~~~~~~~~~~~~~~
diameter.cpp: In function 'int main()':
diameter.cpp:57:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |  scanf("%d %d %lld", &n, &q, &w);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:61:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |   int a, b; long long c; scanf("%d %d %lld", &a, &b, &c);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 5 ms 5004 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 5 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 4 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 4 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 5 ms 5004 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 5 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 4 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 4 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 161 ms 5100 KB Output is correct
20 Correct 162 ms 5100 KB Output is correct
21 Correct 184 ms 5228 KB Output is correct
22 Correct 216 ms 5228 KB Output is correct
23 Correct 1182 ms 5484 KB Output is correct
24 Correct 1239 ms 5752 KB Output is correct
25 Correct 1336 ms 5400 KB Output is correct
26 Correct 1605 ms 5996 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 6 ms 4972 KB Output is correct
4 Correct 12 ms 5100 KB Output is correct
5 Correct 48 ms 5484 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 5 ms 5100 KB Output is correct
10 Correct 14 ms 5100 KB Output is correct
11 Correct 57 ms 5740 KB Output is correct
12 Correct 7 ms 5484 KB Output is correct
13 Correct 7 ms 5484 KB Output is correct
14 Correct 8 ms 5612 KB Output is correct
15 Correct 19 ms 5868 KB Output is correct
16 Correct 66 ms 7020 KB Output is correct
17 Correct 77 ms 15712 KB Output is correct
18 Correct 72 ms 15584 KB Output is correct
19 Correct 74 ms 15712 KB Output is correct
20 Correct 93 ms 15968 KB Output is correct
21 Correct 207 ms 17268 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5100 KB Output is correct
2 Correct 219 ms 5100 KB Output is correct
3 Correct 1068 ms 5356 KB Output is correct
4 Correct 2143 ms 5868 KB Output is correct
5 Incorrect 8 ms 5484 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 9964 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 4972 KB Output is correct
6 Correct 4 ms 4972 KB Output is correct
7 Correct 4 ms 4972 KB Output is correct
8 Correct 5 ms 5004 KB Output is correct
9 Correct 4 ms 4972 KB Output is correct
10 Correct 5 ms 4972 KB Output is correct
11 Correct 4 ms 4972 KB Output is correct
12 Correct 4 ms 4972 KB Output is correct
13 Correct 4 ms 4972 KB Output is correct
14 Correct 4 ms 4972 KB Output is correct
15 Correct 4 ms 4972 KB Output is correct
16 Correct 4 ms 4972 KB Output is correct
17 Correct 4 ms 4972 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 161 ms 5100 KB Output is correct
20 Correct 162 ms 5100 KB Output is correct
21 Correct 184 ms 5228 KB Output is correct
22 Correct 216 ms 5228 KB Output is correct
23 Correct 1182 ms 5484 KB Output is correct
24 Correct 1239 ms 5752 KB Output is correct
25 Correct 1336 ms 5400 KB Output is correct
26 Correct 1605 ms 5996 KB Output is correct
27 Correct 4 ms 4972 KB Output is correct
28 Correct 4 ms 4972 KB Output is correct
29 Correct 6 ms 4972 KB Output is correct
30 Correct 12 ms 5100 KB Output is correct
31 Correct 48 ms 5484 KB Output is correct
32 Correct 4 ms 4992 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 4 ms 5100 KB Output is correct
35 Correct 5 ms 5100 KB Output is correct
36 Correct 14 ms 5100 KB Output is correct
37 Correct 57 ms 5740 KB Output is correct
38 Correct 7 ms 5484 KB Output is correct
39 Correct 7 ms 5484 KB Output is correct
40 Correct 8 ms 5612 KB Output is correct
41 Correct 19 ms 5868 KB Output is correct
42 Correct 66 ms 7020 KB Output is correct
43 Correct 77 ms 15712 KB Output is correct
44 Correct 72 ms 15584 KB Output is correct
45 Correct 74 ms 15712 KB Output is correct
46 Correct 93 ms 15968 KB Output is correct
47 Correct 207 ms 17268 KB Output is correct
48 Correct 25 ms 5100 KB Output is correct
49 Correct 219 ms 5100 KB Output is correct
50 Correct 1068 ms 5356 KB Output is correct
51 Correct 2143 ms 5868 KB Output is correct
52 Incorrect 8 ms 5484 KB Output isn't correct
53 Halted 0 ms 0 KB -