# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262020 | youssefbou62 | Werewolf (IOI18_werewolf) | C++14 | 481 ms | 36072 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 "werewolf.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define pb push_back
#define fi first
#define se second
#define pi pair<int,int>
#define all(x) x.begin(),x.end()
using namespace std;
const int MAXN = 2e5+5 ;
bool visited0[MAXN];
int cnt , g_left[MAXN],g_right[MAXN],par[MAXN],pos[MAXN];
pi start_int[MAXN],end_int[MAXN];
vector<int> adj[MAXN] ;
void dfs0(int u){
visited0[u] = 1 ;
pos[u] = cnt ;
par[u] = u ;
cnt ++ ;
for(int v : adj[u]){
if( !visited0[v] ){
dfs0(v);
}
}
}
# | 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... |