oj.uz

답안 #309701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309701 2020-10-04T10:31:34 Z AmineWeslati Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 32396 KB 
//Never stop trying

#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}


int N,Q,W;

vi adj[MX];
vpi edges;
unordered_map<int,int> ed[MX];


bool sub3(){
	FOR(i,0,N-1){
		if(edges[i].fi!=1 && edges[i].se!=-1) return false;
	}	
	return true;
}

int dist[MX];

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

int solve(){
	FOR(i,1,N+1) dist[i]=-INF; 
	dist[1]=0;
	dfs(1,1);
	int d=0,u=1;
	FOR(i,2,N+1)
		if(dist[i]>d){
			d=dist[i];
			u=i;
		}

	FOR(i,1,N+1) dist[i]=-INF; 
	dist[u]=0;
	dfs(u,u);
	d=0;
	FOR(i,1,N+1)
		if(dist[i]>d) d=dist[i];
		
	return d;
}



int32_t main() {
	boost;

	cin>>N>>Q>>W;
	
	FOR(i,0,N-1){
		int u,v,w; cin>>u>>v>>w;
		edges.pb({u,v});
		adj[u].pb(v); adj[v].pb(u);
		ed[u][v]=w; ed[v][u]=w;
	}

	if(sub3()){
		multiset<int> s;
		int w[N]; 
		FOR(i,0,N-1){
			w[i]=ed[edges[i].fi][edges[i].se];
			s.insert(w[i]);
		}

		int last=0;
		while(Q--){
			int i,nw; cin>>i>>nw;
			i=(i+last)%(N-1);
			nw=(nw+last)%W;
			int u=edges[i].fi,v=edges[i].se;
			s.erase(s.find(w[i]));
			w[i]=nw;
			s.insert(w[i]);
			auto it=s.end(); it--;
			int res=(*it);
			if(it!=s.begin()){
				it--; res+=(*it);
			}
			cout << res << endl;
			last=res;
		}
	}
	else{
		int last=0;
		while(Q--){
			int i,w; cin>>i>>w;
			i=(i+last)%(N-1);
			w=(w+last)%W;
			int u=edges[i].fi,v=edges[i].se;
			ed[u][v]=ed[v][u]=w;

			
			int res=solve();
			cout << res << endl;
			last=res;	
			
		}
	}




	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

diameter.cpp: In function 'int32_t main()':
diameter.cpp:125:8: warning: unused variable 'u' [-Wunused-variable]
  125 |    int u=edges[i].fi,v=edges[i].se;
      |        ^
diameter.cpp:125:22: warning: unused variable 'v' [-Wunused-variable]
  125 |    int u=edges[i].fi,v=edges[i].se;
      |                      ^
diameter.cpp: In function 'void IO()':
diameter.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 6 ms 8192 KB Output is correct
5 Correct 6 ms 8192 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 6 ms 8192 KB Output is correct
10 Correct 6 ms 8192 KB Output is correct
11 Correct 6 ms 8192 KB Output is correct
12 Correct 6 ms 8192 KB Output is correct
13 Correct 6 ms 8192 KB Output is correct
14 Correct 6 ms 8192 KB Output is correct
15 Correct 6 ms 8192 KB Output is correct
16 Correct 6 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 6 ms 8192 KB Output is correct
19 Correct 300 ms 8440 KB Output is correct
20 Correct 306 ms 8320 KB Output is correct
21 Correct 312 ms 8408 KB Output is correct
22 Correct 339 ms 8448 KB Output is correct
23 Correct 2281 ms 9208 KB Output is correct
24 Correct 2329 ms 9180 KB Output is correct
25 Correct 2440 ms 9348 KB Output is correct
26 Correct 2386 ms 9592 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 13 ms 8320 KB Output is correct
5 Correct 44 ms 8568 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8320 KB Output is correct
9 Correct 7 ms 8320 KB Output is correct
10 Correct 15 ms 8320 KB Output is correct
11 Correct 50 ms 8772 KB Output is correct
12 Correct 10 ms 9216 KB Output is correct
13 Correct 12 ms 9216 KB Output is correct
14 Correct 11 ms 9344 KB Output is correct
15 Correct 21 ms 9344 KB Output is correct
16 Correct 63 ms 10360 KB Output is correct
17 Correct 116 ms 30732 KB Output is correct
18 Correct 116 ms 30732 KB Output is correct
19 Correct 117 ms 30732 KB Output is correct
20 Correct 135 ms 31116 KB Output is correct
21 Correct 247 ms 32396 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 8320 KB Output is correct
2 Correct 451 ms 8440 KB Output is correct
3 Correct 2224 ms 8696 KB Output is correct
4 Correct 4472 ms 9000 KB Output is correct
5 Correct 486 ms 9972 KB Output is correct
6 Correct 4647 ms 10100 KB Output is correct
7 Execution timed out 5088 ms 10136 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5097 ms 24036 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8192 KB Output is correct
2 Correct 6 ms 8192 KB Output is correct
3 Correct 6 ms 8192 KB Output is correct
4 Correct 6 ms 8192 KB Output is correct
5 Correct 6 ms 8192 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 6 ms 8192 KB Output is correct
8 Correct 6 ms 8192 KB Output is correct
9 Correct 6 ms 8192 KB Output is correct
10 Correct 6 ms 8192 KB Output is correct
11 Correct 6 ms 8192 KB Output is correct
12 Correct 6 ms 8192 KB Output is correct
13 Correct 6 ms 8192 KB Output is correct
14 Correct 6 ms 8192 KB Output is correct
15 Correct 6 ms 8192 KB Output is correct
16 Correct 6 ms 8192 KB Output is correct
17 Correct 6 ms 8192 KB Output is correct
18 Correct 6 ms 8192 KB Output is correct
19 Correct 300 ms 8440 KB Output is correct
20 Correct 306 ms 8320 KB Output is correct
21 Correct 312 ms 8408 KB Output is correct
22 Correct 339 ms 8448 KB Output is correct
23 Correct 2281 ms 9208 KB Output is correct
24 Correct 2329 ms 9180 KB Output is correct
25 Correct 2440 ms 9348 KB Output is correct
26 Correct 2386 ms 9592 KB Output is correct
27 Correct 6 ms 8192 KB Output is correct
28 Correct 6 ms 8192 KB Output is correct
29 Correct 6 ms 8192 KB Output is correct
30 Correct 13 ms 8320 KB Output is correct
31 Correct 44 ms 8568 KB Output is correct
32 Correct 6 ms 8192 KB Output is correct
33 Correct 6 ms 8192 KB Output is correct
34 Correct 6 ms 8320 KB Output is correct
35 Correct 7 ms 8320 KB Output is correct
36 Correct 15 ms 8320 KB Output is correct
37 Correct 50 ms 8772 KB Output is correct
38 Correct 10 ms 9216 KB Output is correct
39 Correct 12 ms 9216 KB Output is correct
40 Correct 11 ms 9344 KB Output is correct
41 Correct 21 ms 9344 KB Output is correct
42 Correct 63 ms 10360 KB Output is correct
43 Correct 116 ms 30732 KB Output is correct
44 Correct 116 ms 30732 KB Output is correct
45 Correct 117 ms 30732 KB Output is correct
46 Correct 135 ms 31116 KB Output is correct
47 Correct 247 ms 32396 KB Output is correct
48 Correct 51 ms 8320 KB Output is correct
49 Correct 451 ms 8440 KB Output is correct
50 Correct 2224 ms 8696 KB Output is correct
51 Correct 4472 ms 9000 KB Output is correct
52 Correct 486 ms 9972 KB Output is correct
53 Correct 4647 ms 10100 KB Output is correct
54 Execution timed out 5088 ms 10136 KB Time limit exceeded
55 Halted 0 ms 0 KB -