# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304977 | arnold518 | Stations (IOI20_stations) | C++14 | 1176 ms | 1128 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
static const int MAXN = 1000;
static int N, K;
static vector<int> adj[MAXN+10];
static int L[MAXN+10], R[MAXN+10], D[MAXN+10];
static int ans[MAXN+10];
static int cnt;
void dfs(int now, int bef, int col)
{
if(col) cnt++;
L[now]=cnt;
D[now]=col;
for(int nxt : adj[now])
{
if(nxt==bef) continue;
dfs(nxt, now, 1-col);
}
if(!col) cnt++;
R[now]=cnt;
}
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... |