# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218081 | brainwarego | 트리 (KOI16_tree) | C++14 | 307 ms | 16376 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 <stdio.h>
#define LM 200010
int N, Q, par[LM], group[LM], gn;
int used[LM], gtop[LM] = {1};
struct Node{
int node;
Node*next;
}adj[LM], buf[LM*3];
int bCnt;
struct Queue{
Node*now;
Node* hasNext(){
while(now->next && used[now->next->node]){
now->next = now->next->next;
}
now = now->next;
return now;
}
}xQue[LM], yQue[LM];
int xf, xe, yf, ye;
void push_adj(int s, int e){
buf[bCnt] = {e, adj[s].next};
adj[s].next = buf + bCnt++;
}
void reGroup(int k){
group[k] = gn;
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... |