oj.uz

Submission #967764

# Submission time Handle Problem Language Result Execution time Memory
967764 2024-04-22T19:20:39 Z shadow_sami Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 27572 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vector<pi> adj[mx];
ll c[mx];
ll dp[mx];
ll sr,de;

void dfs(ll u,ll par){
	fx(adj[u])
		if(x.ff!=par){
			dp[x.ff] = dp[u] + c[x.ss];
			dfs(x.ff,u);
		}
	return;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m>>tp;
        fip(0,n-1){
        	cin>>sr>>de>>tptp;
        	adj[sr].push_back({de,i});
        	adj[de].push_back({sr,i});
        	c[i] = tptp;
    	}
    	res = 0;
    	while(m--){
    		cin>>sr>>de;
    		sr += res;
    		sr %= (n-1);
    		de += res;
    		de %= (tp);
    		c[sr] = de;
    		dp[1] = 0;
    		dfs(1,-1);
    		ans = 0;
    		tp2 = 0;
    		fip(1,n+1)	
    			if(dp[i] > ans){
    				ans = dp[i];
    				tp2 = i;
    			}
    		dp[tp2] = 0;
    		dfs(tp2,-1);
    		ans = 0;
    		tp2 = 0;
    		fip(1,n+1)	
    			if(dp[i] > ans){
    				ans = dp[i];
    				tp2 = i;
    			}
    		cout<<ans<<nli;    		
    		res = ans;
    	}
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15708 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15752 KB Output is correct
5 Correct 3 ms 15708 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 4 ms 15556 KB Output is correct
8 Correct 3 ms 15708 KB Output is correct
9 Correct 3 ms 15704 KB Output is correct
10 Correct 3 ms 15704 KB Output is correct
11 Correct 5 ms 15708 KB Output is correct
12 Correct 3 ms 15708 KB Output is correct
13 Correct 5 ms 15708 KB Output is correct
14 Correct 3 ms 15708 KB Output is correct
15 Correct 3 ms 15748 KB Output is correct
16 Correct 3 ms 15708 KB Output is correct
17 Correct 3 ms 15708 KB Output is correct
18 Correct 3 ms 15708 KB Output is correct
19 Correct 70 ms 15708 KB Output is correct
20 Correct 78 ms 15864 KB Output is correct
21 Correct 82 ms 15876 KB Output is correct
22 Correct 109 ms 15952 KB Output is correct
23 Correct 744 ms 16652 KB Output is correct
24 Correct 970 ms 16432 KB Output is correct
25 Correct 1103 ms 16468 KB Output is correct
26 Correct 1239 ms 16724 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15708 KB Output is correct
2 Correct 5 ms 15708 KB Output is correct
3 Correct 4 ms 15708 KB Output is correct
4 Correct 14 ms 15960 KB Output is correct
5 Correct 50 ms 16720 KB Output is correct
6 Correct 3 ms 15708 KB Output is correct
7 Correct 3 ms 15708 KB Output is correct
8 Correct 4 ms 15708 KB Output is correct
9 Correct 13 ms 15708 KB Output is correct
10 Correct 100 ms 15964 KB Output is correct
11 Correct 497 ms 17228 KB Output is correct
12 Correct 6 ms 15964 KB Output is correct
13 Correct 14 ms 15964 KB Output is correct
14 Correct 95 ms 16140 KB Output is correct
15 Correct 919 ms 16580 KB Output is correct
16 Correct 4632 ms 17560 KB Output is correct
17 Correct 44 ms 25804 KB Output is correct
18 Correct 235 ms 26044 KB Output is correct
19 Correct 1886 ms 25964 KB Output is correct
20 Execution timed out 5049 ms 26128 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 15704 KB Output is correct
2 Correct 121 ms 15944 KB Output is correct
3 Correct 559 ms 16468 KB Output is correct
4 Correct 1110 ms 17168 KB Output is correct
5 Correct 121 ms 16476 KB Output is correct
6 Correct 1145 ms 16476 KB Output is correct
7 Execution timed out 5066 ms 17200 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5028 ms 27572 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15708 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 3 ms 15708 KB Output is correct
4 Correct 3 ms 15752 KB Output is correct
5 Correct 3 ms 15708 KB Output is correct
6 Correct 4 ms 15708 KB Output is correct
7 Correct 4 ms 15556 KB Output is correct
8 Correct 3 ms 15708 KB Output is correct
9 Correct 3 ms 15704 KB Output is correct
10 Correct 3 ms 15704 KB Output is correct
11 Correct 5 ms 15708 KB Output is correct
12 Correct 3 ms 15708 KB Output is correct
13 Correct 5 ms 15708 KB Output is correct
14 Correct 3 ms 15708 KB Output is correct
15 Correct 3 ms 15748 KB Output is correct
16 Correct 3 ms 15708 KB Output is correct
17 Correct 3 ms 15708 KB Output is correct
18 Correct 3 ms 15708 KB Output is correct
19 Correct 70 ms 15708 KB Output is correct
20 Correct 78 ms 15864 KB Output is correct
21 Correct 82 ms 15876 KB Output is correct
22 Correct 109 ms 15952 KB Output is correct
23 Correct 744 ms 16652 KB Output is correct
24 Correct 970 ms 16432 KB Output is correct
25 Correct 1103 ms 16468 KB Output is correct
26 Correct 1239 ms 16724 KB Output is correct
27 Correct 5 ms 15708 KB Output is correct
28 Correct 5 ms 15708 KB Output is correct
29 Correct 4 ms 15708 KB Output is correct
30 Correct 14 ms 15960 KB Output is correct
31 Correct 50 ms 16720 KB Output is correct
32 Correct 3 ms 15708 KB Output is correct
33 Correct 3 ms 15708 KB Output is correct
34 Correct 4 ms 15708 KB Output is correct
35 Correct 13 ms 15708 KB Output is correct
36 Correct 100 ms 15964 KB Output is correct
37 Correct 497 ms 17228 KB Output is correct
38 Correct 6 ms 15964 KB Output is correct
39 Correct 14 ms 15964 KB Output is correct
40 Correct 95 ms 16140 KB Output is correct
41 Correct 919 ms 16580 KB Output is correct
42 Correct 4632 ms 17560 KB Output is correct
43 Correct 44 ms 25804 KB Output is correct
44 Correct 235 ms 26044 KB Output is correct
45 Correct 1886 ms 25964 KB Output is correct
46 Execution timed out 5049 ms 26128 KB Time limit exceeded
47 Halted 0 ms 0 KB -