# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75913 | georgerapeanu | Werewolf (IOI18_werewolf) | C++11 | 2318 ms | 158608 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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int NMAX = 2e5;
const int LGMAX = 19;
vector< vector<int> > graph;
vector< vector<int> > tree_untill;
vector< vector<int> > tree_from;
int father_untill[LGMAX][NMAX + 5];
int father_from[LGMAX][NMAX + 5];
int root_untill;
int root_from;
int fa[NMAX + 5];
vector<int> aint(1,0);
vector<int> leftson(1,0);
vector<int> rightson(1,0);
vector<int> root;
void aint_init(int nod,int st,int dr){
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... |