# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20643 | model_code | 트리 (KOI16_tree) | C++11 | 849 ms | 31200 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>
#include<vector>
#include<deque>
#define MAX 400100
#pragma warning(disable:4996)
using namespace std;
struct xy {
int x, y, z;
};
int labelw;
int label[MAX];
vector<xy>edge[MAX];
deque<int>st1;
bool is_gone[MAX];
int cut1, cut2;
int parent[MAX];
int ep[2][MAX];
void un_check(int w) {
int i;
is_gone[w] = 0;
for (i = 0; i < edge[w].size(); i++) {
if (is_gone[edge[w][i].x] == 0) continue;
un_check(edge[w][i].x);
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... |