# | TimeUTC-0 | 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] ) );
}
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... |