# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699373 | flappybird | Shuffle (NOI19_shuffle) | C++17 | 2 ms | 596 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 "shuffle.h"
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
typedef pair<int, int> pii;
#define MAX 1010
vector<int> adj[MAX];
pii v2p(vector<int> v) {
return pii(min(v[0], v[1]), max(v[0], v[1]));
}
int cnt;
int vis[MAX];
int ord[MAX];
int rev[MAX];
void dfs(int x) {
if (vis[x]) return;
vis[x] = 1;
ord[++cnt] = x;
for (auto v : adj[x]) dfs(v);
}
vector<vector<int>> listall;
vector<vector<int>> tree[MAX];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |