oj.uz

Submission #524647

# Submission time Handle Problem Language Result Execution time Memory
524647 2022-02-09T18:02:21 Z ammar2000 Dynamic Diameter (CEOI19_diameter) C++17
11 / 100
 5000 ms 16448 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,q,w,last,len[SI];
ll vis[SI],c,ans;
vector < pair < ll,ll> > v[SI];
void dfs(int node,ll dep)
{
    vis[node]=c;
    ans=max(ans,dep);
    for (auto i:v[node])
    {
        if (vis[i.F]==c)
            continue ;
        dfs(i.F,dep+len[i.S]);
    }
}
void DFS()
{
    for (int i=1;i<=n;i++)
        c++,dfs(i,0);
    cout << ans<<"\n";
}
int main()
{
   fast
   cin>>n>>q>>w;
   for (int i=0;i<n-1;i++)
   {
       ll a,b,c;
       cin>>a>>b>>c;
       len[i]=c;
       v[a].pb({b,i});
       v[b].pb({a,i});
   }
   while (q--)
   {
       ll d,e;
       cin>>d>>e;
       d=(d+last)%(n-1);
       e=(e+last)%w;
       len[d]=e;
       ans=-1;
       c++;
       //for (int i=0;i<n-1;i++)\
        cout<< len[i]<<" ";\
       cout <<"\n";
       DFS();
       last=ans;
   }
   return 0;
}

Compilation message

diameter.cpp:59:8: warning: multi-line comment [-Wcomment]
   59 |        //for (int i=0;i<n-1;i++)\
      |        ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7368 KB Output is correct
3 Correct 4 ms 7256 KB Output is correct
4 Correct 4 ms 7368 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 3 ms 7372 KB Output is correct
7 Correct 6 ms 7364 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 6 ms 7364 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 6 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 10 ms 7372 KB Output is correct
14 Correct 10 ms 7376 KB Output is correct
15 Correct 10 ms 7372 KB Output is correct
16 Correct 10 ms 7368 KB Output is correct
17 Correct 11 ms 7364 KB Output is correct
18 Correct 10 ms 7372 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7368 KB Output is correct
3 Correct 4 ms 7256 KB Output is correct
4 Correct 4 ms 7368 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 3 ms 7372 KB Output is correct
7 Correct 6 ms 7364 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 6 ms 7364 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 6 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 10 ms 7372 KB Output is correct
14 Correct 10 ms 7376 KB Output is correct
15 Correct 10 ms 7372 KB Output is correct
16 Correct 10 ms 7368 KB Output is correct
17 Correct 11 ms 7364 KB Output is correct
18 Correct 10 ms 7372 KB Output is correct
19 Execution timed out 5050 ms 7476 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 13 ms 7412 KB Output is correct
4 Correct 64 ms 7504 KB Output is correct
5 Correct 290 ms 8444 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 32 ms 7412 KB Output is correct
8 Correct 279 ms 7372 KB Output is correct
9 Correct 2759 ms 7416 KB Output is correct
10 Execution timed out 5082 ms 7512 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7368 KB Output is correct
3 Correct 4 ms 7256 KB Output is correct
4 Correct 4 ms 7368 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 3 ms 7372 KB Output is correct
7 Correct 6 ms 7364 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 6 ms 7364 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 6 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 10 ms 7372 KB Output is correct
14 Correct 10 ms 7376 KB Output is correct
15 Correct 10 ms 7372 KB Output is correct
16 Correct 10 ms 7368 KB Output is correct
17 Correct 11 ms 7364 KB Output is correct
18 Correct 10 ms 7372 KB Output is correct
19 Execution timed out 5050 ms 7476 KB Time limit exceeded
20 Halted 0 ms 0 KB -