oj.uz

답안 #943952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943952 2024-03-12T05:23:06 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 2358 ms 33360 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;
 
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 1e5 + 100, mxc = 105, inf = 1e18, MX = 1e5 + 10;

set <pair <int,int> > g[N];

int t[N * 4][2];
int tx[N * 4];
int di[N * 4];

void update(int v){
	tx[v] = max(t[v * 2][0] + t[v * 2][1], t[v * 2 + 1][0] + t[v * 2 + 1][1]);
	tx[v] = max({tx[v], tx[v * 2], tx[v * 2 + 1]});
	if(v == 1)return;	
    int par = v / 2;
    t[par][v & 1] = max(t[v][0], t[v][1]) + di[v];
    update(par);
}
 
int res=0,mx=0,va;

void dfs(int v,int par = -1,int dis = 0){
	if(dis>mx){
		mx=dis;
		va=v;
	}
	for(auto to:g[v]){
		if(to.ss==par){
			continue;
		}
		dfs(to.ss,v,dis+to.ff);
	}
}

main(){
	iostream::sync_with_stdio	(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, q, W;
    cin >> n >> q >> W;
	vector <array<int, 3> > vp(n);
	set <pair <int,int> > st;
	bool flag1 = 1;
	for(int i = 0; i < n - 1; i++){
		int a, b, c;
		cin >> a >> b >> c;
		g[a].insert({c, b});
		g[b].insert({c, a});
		di[b] = c;
		flag1 &= (a == 1);
		st.insert({c, b});
		vp[i] = {a, b, c};
	}
	for(int i = n; i >= 1; i--){
		update(i);
	}
	int last = 0;
	while(q--){
		int d, e;
		cin >> d >> e;
		d = (d + last) % (n - 1);
		e = (e + last) % W;
		auto &[a, b, c] = vp[d];
		g[a].erase({c, b});
		g[b].erase({c, a});
		st.erase({c, b});
		di[b] = e;
		g[a].insert({e, b});
		g[b].insert({e, a});
		vp[d][2] = e;
		//if(b / 2 != a)return EXIT_FAILURE;
		update(b);
		if(flag1){
			st.insert({e, b});
			auto it = --st.end();
			int res = it ->ff;
			if(it != st.begin()){
				it--;
				last = res + it ->ff;
				cout << res + it ->ff << endl;
			}else{
				cout << res << endl;
				last = res;
			}
		}else if(n <= 5000){
			dfs(1);
			dfs(va);
			cout << mx << endl;
			last = mx;
			mx = -inf;
		}else{
			cout << max(tx[1], t[1][1] + t[1][0]) << endl;
			last =  max(tx[1], t[1][1] + t[1][0]);
		}
		//cout <<"ind"<< last % (n - 1)<< endl;
		/*else{
			dfs(1);
			dfs(va);
			cout << mx << endl;
			last = mx;
			mx = -inf;
		}
		*/ 
	}
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

diameter.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main(){
      | ^~~~
diameter.cpp: In function 'void fp(std::string)':
diameter.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7100 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7100 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 3 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7100 KB Output is correct
17 Correct 2 ms 7260 KB Output is correct
18 Correct 2 ms 7188 KB Output is correct
19 Correct 156 ms 7512 KB Output is correct
20 Correct 173 ms 7760 KB Output is correct
21 Correct 171 ms 7512 KB Output is correct
22 Correct 193 ms 7540 KB Output is correct
23 Correct 1587 ms 10432 KB Output is correct
24 Correct 1707 ms 10328 KB Output is correct
25 Correct 1864 ms 10708 KB Output is correct
26 Correct 2358 ms 10852 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 5 ms 7260 KB Output is correct
4 Correct 33 ms 7260 KB Output is correct
5 Correct 161 ms 7664 KB Output is correct
6 Correct 2 ms 7256 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 6 ms 7196 KB Output is correct
10 Correct 37 ms 7260 KB Output is correct
11 Correct 211 ms 7692 KB Output is correct
12 Correct 5 ms 10332 KB Output is correct
13 Correct 8 ms 10332 KB Output is correct
14 Correct 12 ms 10332 KB Output is correct
15 Correct 45 ms 10488 KB Output is correct
16 Correct 214 ms 11328 KB Output is correct
17 Correct 111 ms 31204 KB Output is correct
18 Correct 122 ms 31292 KB Output is correct
19 Correct 115 ms 31244 KB Output is correct
20 Correct 180 ms 31316 KB Output is correct
21 Correct 539 ms 31976 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 7512 KB Output is correct
2 Correct 213 ms 7544 KB Output is correct
3 Correct 1063 ms 7764 KB Output is correct
4 Correct 2142 ms 8212 KB Output is correct
5 Correct 13 ms 11520 KB Output is correct
6 Correct 25 ms 11584 KB Output is correct
7 Correct 99 ms 11828 KB Output is correct
8 Correct 173 ms 11916 KB Output is correct
9 Correct 48 ms 22352 KB Output is correct
10 Correct 61 ms 22360 KB Output is correct
11 Correct 135 ms 22612 KB Output is correct
12 Correct 225 ms 22860 KB Output is correct
13 Correct 106 ms 31384 KB Output is correct
14 Correct 126 ms 31476 KB Output is correct
15 Correct 211 ms 31572 KB Output is correct
16 Correct 354 ms 31828 KB Output is correct
17 Correct 322 ms 31828 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 411 ms 33360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7100 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7100 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 3 ms 7260 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 2 ms 7100 KB Output is correct
17 Correct 2 ms 7260 KB Output is correct
18 Correct 2 ms 7188 KB Output is correct
19 Correct 156 ms 7512 KB Output is correct
20 Correct 173 ms 7760 KB Output is correct
21 Correct 171 ms 7512 KB Output is correct
22 Correct 193 ms 7540 KB Output is correct
23 Correct 1587 ms 10432 KB Output is correct
24 Correct 1707 ms 10328 KB Output is correct
25 Correct 1864 ms 10708 KB Output is correct
26 Correct 2358 ms 10852 KB Output is correct
27 Correct 2 ms 7260 KB Output is correct
28 Correct 2 ms 7260 KB Output is correct
29 Correct 5 ms 7260 KB Output is correct
30 Correct 33 ms 7260 KB Output is correct
31 Correct 161 ms 7664 KB Output is correct
32 Correct 2 ms 7256 KB Output is correct
33 Correct 2 ms 7260 KB Output is correct
34 Correct 2 ms 7260 KB Output is correct
35 Correct 6 ms 7196 KB Output is correct
36 Correct 37 ms 7260 KB Output is correct
37 Correct 211 ms 7692 KB Output is correct
38 Correct 5 ms 10332 KB Output is correct
39 Correct 8 ms 10332 KB Output is correct
40 Correct 12 ms 10332 KB Output is correct
41 Correct 45 ms 10488 KB Output is correct
42 Correct 214 ms 11328 KB Output is correct
43 Correct 111 ms 31204 KB Output is correct
44 Correct 122 ms 31292 KB Output is correct
45 Correct 115 ms 31244 KB Output is correct
46 Correct 180 ms 31316 KB Output is correct
47 Correct 539 ms 31976 KB Output is correct
48 Correct 26 ms 7512 KB Output is correct
49 Correct 213 ms 7544 KB Output is correct
50 Correct 1063 ms 7764 KB Output is correct
51 Correct 2142 ms 8212 KB Output is correct
52 Correct 13 ms 11520 KB Output is correct
53 Correct 25 ms 11584 KB Output is correct
54 Correct 99 ms 11828 KB Output is correct
55 Correct 173 ms 11916 KB Output is correct
56 Correct 48 ms 22352 KB Output is correct
57 Correct 61 ms 22360 KB Output is correct
58 Correct 135 ms 22612 KB Output is correct
59 Correct 225 ms 22860 KB Output is correct
60 Correct 106 ms 31384 KB Output is correct
61 Correct 126 ms 31476 KB Output is correct
62 Correct 211 ms 31572 KB Output is correct
63 Correct 354 ms 31828 KB Output is correct
64 Correct 322 ms 31828 KB Output is correct
65 Incorrect 411 ms 33360 KB Output isn't correct
66 Halted 0 ms 0 KB -