# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
248707 | Lawliet | Synchronization (JOI13_synchronization) | C++17 | 120 ms | 18552 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int INF = 1000000010;
int n, m, q;
int mnTime[MAXN], mxTime[MAXN];
bool act[MAXN];
vector<int> adj[MAXN];
vector<int> indEdge[MAXN];
int DFS(int cur, int p, int t)
{
int ans = 1;
for(int i = 0 ; i < (int)adj[cur].size() ; i++)
{
int viz = adj[cur][i];
int ind = indEdge[cur][i];
if( viz == p ) continue;
if( t < mnTime[ind] ) continue;
ans += DFS( viz , cur , min( t , mxTime[ind] ) );
}
return ans;
}
int main()
{
scanf("%d %d %d",&n,&m,&q);
for(int i = 1 ; i < n ; i++)
{
int U, V;
scanf("%d %d",&U,&V);
adj[U].push_back( V );
adj[V].push_back( U );
indEdge[U].push_back( i );
indEdge[V].push_back( i );
mnTime[i] = INF; mxTime[i] = -INF;
}
for(int i = 1 ; i <= m ; i++)
{
int ind;
scanf("%d",&ind);
if( !act[ind] ) mnTime[ind] = min( mnTime[ind] , i );
else mxTime[ind] = max( mxTime[ind] , i - 1 );
act[ind] = !act[ind];
}
for(int i = 1 ; i < n ; i++)
if( mnTime[i] != INF && mnTime[i] > mxTime[i] ) mxTime[i] = INF;
for(int i = 1 ; i <= q ; i++)
{
int root;
scanf("%d",&root);
printf("%d\n",DFS( root , root , INF ));
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |