# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711762 | dum123 | Amusement Park (JOI17_amusement_park) | C++14 | 382 ms | 207864 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 "Joi.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
struct node{
int idx = -1, visited = 0, val=0;
vector<int> adj, tree;
} nodes[10069];
vector<int> BinaryConvert(long long X){
vector<int> res;
while(X > 0){
res.pb(X % 2);
X/=2;
}
while(res.size()<60) res.pb(0);
return res;
}
bool connected[10069][10069];
void CopyTree (int target, int neighbor){
int adjCount[10069], cut;
memset(adjCount, 0, sizeof(adjCount));
vector<int> pohon = nodes[neighbor].tree;
for(int i = 0; i < pohon.size() ; i++){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |