# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76236 | khsoo01 | Werewolf (IOI18_werewolf) | C++11 | 1290 ms | 123464 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 X first
#define Y second
using namespace std;
typedef pair<int, int> pii;
const int N = 200005, M = 400005, F = 262144, G = 19, inf = 1e9;
int n, m, q, its[N];
vector<pii> edg;
struct event {
int p, l, r, v, i;
bool operator < (const event &T) const {
return p < T.p;
}
};
vector<event> swp;
struct disjoint_set {
int par[2*N];
void init (int X) {
for(int i=1;i<=X;i++) {
par[i] = i;
}
}
# | 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... |