# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75111 | Namnamseo | Werewolf (IOI18_werewolf) | C++17 | 2183 ms | 169764 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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rrep(i,n) for(int i=1; i<=(n); ++i)
#define all(v) (v).begin(), (v).end()
#define x first
#define y second
#define pb push_back
#define eb emplace_back
using pp=pair<int,int>;
const int MAX_N = 200001;
const int MAX_V = 400001;
int n;
vector<int> gp[MAX_N];
struct asdf {
int par[MAX_N];
int tnode[MAX_N];
vector<int> te[MAX_V];
int tp[20][MAX_V];
int tt[MAX_V];
int 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... |