# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95260 | andy627 | Simurgh (IOI17_simurgh) | C++17 | 180 ms | 5340 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 "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
int G[505][505];
int T[505][505];
int N;
bool vst[505];
int E[505][505];
vector<int> Q;
int P[505];
vector<int> ans;
int S[505][505];
int I;
bool C[505];
void maketree(int now) {
vst[now] = true;
for(int i = 0; i < N; i++) {
if(vst[i]) continue;
if(G[now][i] == -2) continue;
T[now][i] = T[i][now] = 1;
Q.push_back(E[now][i]);
P[i] = now;
maketree(i);
}
}
void sib() {
for(int i = 0; i < N; 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... |