# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553241 | jamezzz | 늑대인간 (IOI18_werewolf) | C++17 | 906 ms | 144460 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>
using namespace std;
#define fi first
#define se second
#define pf printf
#define pb push_back
#define all(x) x.begin(),x.end()
typedef vector<int> vi;
typedef pair<int,int> ii;
#define maxn 400005
int cnt,par[maxn];
void init(int N){
for(int i=0;i<N;++i){
par[i]=i;
}
}
int fp(int i){
return (par[i]==i)?i:par[i]=fp(par[i]);
}
int join(int x,int y){
x=fp(x),y=fp(y);
par[x]=par[y]=cnt;
return cnt++;
}
vi AL1[maxn],AL2[maxn],ord1;
# | 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... |