# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422784 | alireza_kaviani | Highway Tolls (IOI18_highway) | C++11 | 286 ms | 15476 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 "highway.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 2e5 + 10;
int n , timer , st[MAXN] , prv[MAXN];
vector<pii> adj[MAXN];
vector<int> get(int x){
vector<int> ans(n - 1 , 0);
for(int i = 0 ; i < n ; i++){
if(st[i] >= x) ans[prv[i]] = 1;
}
return ans;
}
void DFS(int v , int p = -1){
st[v] = ++timer;
for(pii i : adj[v]){
int u = i.first , w = i.second;
if(u == p) continue;
prv[u] = w;
DFS(u , v);
}
}
int solve(int root){
fill(st , st + MAXN , 0);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |