oj.uz

답안 #943918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943918 2024-03-12T04:30:10 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 27816 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 res=0,mx=0,va;
void dfs(int v,int par = -1,int dis = 0){
	//cout << v <<"-"<< dis << endl;
	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;
	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});
		st.insert({c, b});
		vp[i] = {a, b, c};
	}
	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];
		if(b == 1)
			swap(a, b);
		g[a].erase({c, b});
		g[b].erase({c, a});
		st.erase({c, b});
		g[a].insert({e, b});
		g[b].insert({e, a});
		vp[d][2] = e;
		if(n > 5000 && W > 10000){
			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{
			dfs(1);
			//cout <<"----"<<mx <<" "<< va << endl;
			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:39:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   39 | 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 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 171 ms 5620 KB Output is correct
20 Correct 165 ms 5368 KB Output is correct
21 Correct 173 ms 5716 KB Output is correct
22 Correct 192 ms 5460 KB Output is correct
23 Correct 1600 ms 6216 KB Output is correct
24 Correct 1690 ms 6224 KB Output is correct
25 Correct 1853 ms 6744 KB Output is correct
26 Correct 2360 ms 6480 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 6 ms 4952 KB Output is correct
4 Correct 41 ms 5212 KB Output is correct
5 Correct 195 ms 5452 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 4 ms 5212 KB Output is correct
9 Correct 24 ms 5276 KB Output is correct
10 Correct 222 ms 5456 KB Output is correct
11 Correct 1119 ms 5684 KB Output is correct
12 Correct 9 ms 5976 KB Output is correct
13 Correct 51 ms 6232 KB Output is correct
14 Correct 488 ms 6224 KB Output is correct
15 Correct 4886 ms 6504 KB Output is correct
16 Execution timed out 5060 ms 6228 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 5212 KB Output is correct
2 Correct 216 ms 5412 KB Output is correct
3 Correct 1072 ms 5836 KB Output is correct
4 Correct 2064 ms 5836 KB Output is correct
5 Correct 389 ms 7276 KB Output is correct
6 Correct 3423 ms 7552 KB Output is correct
7 Execution timed out 5027 ms 7352 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 1 ms 4952 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4952 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 171 ms 5620 KB Output is correct
20 Correct 165 ms 5368 KB Output is correct
21 Correct 173 ms 5716 KB Output is correct
22 Correct 192 ms 5460 KB Output is correct
23 Correct 1600 ms 6216 KB Output is correct
24 Correct 1690 ms 6224 KB Output is correct
25 Correct 1853 ms 6744 KB Output is correct
26 Correct 2360 ms 6480 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 2 ms 4952 KB Output is correct
29 Correct 6 ms 4952 KB Output is correct
30 Correct 41 ms 5212 KB Output is correct
31 Correct 195 ms 5452 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 2 ms 5212 KB Output is correct
34 Correct 4 ms 5212 KB Output is correct
35 Correct 24 ms 5276 KB Output is correct
36 Correct 222 ms 5456 KB Output is correct
37 Correct 1119 ms 5684 KB Output is correct
38 Correct 9 ms 5976 KB Output is correct
39 Correct 51 ms 6232 KB Output is correct
40 Correct 488 ms 6224 KB Output is correct
41 Correct 4886 ms 6504 KB Output is correct
42 Execution timed out 5060 ms 6228 KB Time limit exceeded
43 Halted 0 ms 0 KB -