oj.uz

답안 #373731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373731 2021-03-05T14:30:53 Z LucaDantas Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 2111 ms 5228 KB 
#include<bits/stdc++.h>
using namespace std;

constexpr int maxn = 1e5+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<int> 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 = (d + last) % (n - 1);
		e = (e + last) % w;
		st.erase(st.find(cost[d]));
		cost[d] = e;
		st.insert(e);
		last = *st.rbegin() + (n>2?*prev(st.rbegin()):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(n <= 5000) brute();
	if((int)g[1].size() == n-1) bst();
}

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

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 3 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 154 ms 2796 KB Output is correct
20 Correct 162 ms 2796 KB Output is correct
21 Correct 175 ms 2924 KB Output is correct
22 Correct 224 ms 3052 KB Output is correct
23 Correct 1166 ms 3052 KB Output is correct
24 Correct 1271 ms 3180 KB Output is correct
25 Correct 1349 ms 3436 KB Output is correct
26 Correct 1652 ms 3576 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 4 ms 2668 KB Output is correct
4 Correct 21 ms 2796 KB Output is correct
5 Correct 74 ms 3180 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 4 ms 2668 KB Output is correct
9 Correct 21 ms 2668 KB Output is correct
10 Correct 189 ms 2796 KB Output is correct
11 Correct 931 ms 3308 KB Output is correct
12 Incorrect 5 ms 3180 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2796 KB Output is correct
2 Correct 216 ms 2796 KB Output is correct
3 Correct 1088 ms 3144 KB Output is correct
4 Correct 2111 ms 3428 KB Output is correct
5 Incorrect 6 ms 3180 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 5228 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 3 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 154 ms 2796 KB Output is correct
20 Correct 162 ms 2796 KB Output is correct
21 Correct 175 ms 2924 KB Output is correct
22 Correct 224 ms 3052 KB Output is correct
23 Correct 1166 ms 3052 KB Output is correct
24 Correct 1271 ms 3180 KB Output is correct
25 Correct 1349 ms 3436 KB Output is correct
26 Correct 1652 ms 3576 KB Output is correct
27 Correct 2 ms 2668 KB Output is correct
28 Correct 2 ms 2668 KB Output is correct
29 Correct 4 ms 2668 KB Output is correct
30 Correct 21 ms 2796 KB Output is correct
31 Correct 74 ms 3180 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 2 ms 2668 KB Output is correct
34 Correct 4 ms 2668 KB Output is correct
35 Correct 21 ms 2668 KB Output is correct
36 Correct 189 ms 2796 KB Output is correct
37 Correct 931 ms 3308 KB Output is correct
38 Incorrect 5 ms 3180 KB Output isn't correct
39 Halted 0 ms 0 KB -