oj.uz

Submission #967770

# Submission time Handle Problem Language Result Execution time Memory
967770 2024-04-22T19:26:09 Z shadow_sami Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 29228 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 pd[mx];
ll sr,de;

void dfs(ll u,ll par){
	vi v;
	pd[u] = dp[u];
	fx(adj[u])
		if(x.ff!=par){
			dp[x.ff] = dp[u] + c[x.ss];
			dfs(x.ff,u);
			pd[u] = max(pd[u],pd[x.ff]);
			v.push_back(pd[x.ff]);
		}
	srt(v);
	reverse(v.begin(),v.end());
	if((ll)v.size())
		ans = max(v[0]-dp[u],ans);
	if((ll)v.size()>1)
		ans = max(v[0]+v[1]-2*dp[u],ans);
	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;
    		ans = 0;
    		dfs(1,-1);    		
    		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 17496 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 5 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17752 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17496 KB Output is correct
16 Correct 5 ms 17496 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17496 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 5 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17752 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17496 KB Output is correct
16 Correct 5 ms 17496 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 186 ms 17688 KB Output is correct
20 Correct 240 ms 17672 KB Output is correct
21 Correct 196 ms 17496 KB Output is correct
22 Correct 188 ms 17744 KB Output is correct
23 Correct 1180 ms 17912 KB Output is correct
24 Correct 1264 ms 17756 KB Output is correct
25 Correct 1401 ms 18000 KB Output is correct
26 Correct 1229 ms 18480 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17500 KB Output is correct
2 Correct 4 ms 17600 KB Output is correct
3 Correct 5 ms 17496 KB Output is correct
4 Correct 17 ms 17752 KB Output is correct
5 Correct 74 ms 17996 KB Output is correct
6 Correct 3 ms 17496 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 8 ms 17500 KB Output is correct
9 Correct 40 ms 17584 KB Output is correct
10 Correct 364 ms 17636 KB Output is correct
11 Correct 1743 ms 18428 KB Output is correct
12 Correct 11 ms 18012 KB Output is correct
13 Correct 58 ms 18012 KB Output is correct
14 Correct 533 ms 18252 KB Output is correct
15 Execution timed out 5044 ms 18568 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 17500 KB Output is correct
2 Correct 330 ms 17500 KB Output is correct
3 Correct 1644 ms 18184 KB Output is correct
4 Correct 3307 ms 18112 KB Output is correct
5 Correct 343 ms 18008 KB Output is correct
6 Correct 3378 ms 18748 KB Output is correct
7 Execution timed out 5074 ms 18304 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 5019 ms 29228 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 17496 KB Output is correct
2 Correct 4 ms 17496 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 5 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17752 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17496 KB Output is correct
16 Correct 5 ms 17496 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 5 ms 17500 KB Output is correct
19 Correct 186 ms 17688 KB Output is correct
20 Correct 240 ms 17672 KB Output is correct
21 Correct 196 ms 17496 KB Output is correct
22 Correct 188 ms 17744 KB Output is correct
23 Correct 1180 ms 17912 KB Output is correct
24 Correct 1264 ms 17756 KB Output is correct
25 Correct 1401 ms 18000 KB Output is correct
26 Correct 1229 ms 18480 KB Output is correct
27 Correct 3 ms 17500 KB Output is correct
28 Correct 4 ms 17600 KB Output is correct
29 Correct 5 ms 17496 KB Output is correct
30 Correct 17 ms 17752 KB Output is correct
31 Correct 74 ms 17996 KB Output is correct
32 Correct 3 ms 17496 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 8 ms 17500 KB Output is correct
35 Correct 40 ms 17584 KB Output is correct
36 Correct 364 ms 17636 KB Output is correct
37 Correct 1743 ms 18428 KB Output is correct
38 Correct 11 ms 18012 KB Output is correct
39 Correct 58 ms 18012 KB Output is correct
40 Correct 533 ms 18252 KB Output is correct
41 Execution timed out 5044 ms 18568 KB Time limit exceeded
42 Halted 0 ms 0 KB -