# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347076 | patrikpavic2 | Fun Tour (APIO20_fun) | C++17 | 426 ms | 26084 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 "fun.h"
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <set>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef vector < int > vi;
typedef pair < int, int > pii;
const int N = 1e5 + 500;
int root, siz[N], dep[N], ty[N], n;
vector < int > ch;
set < pii > mj[3];
void nadi_centroid(){
int bst = 0; siz[0] = n;
for(int i = 1;i < n;i++){
siz[i] = attractionsBehind(root, i);
if(2 * siz[i] >= n && siz[i] < siz[bst])
bst = i;
}
root = bst;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |