# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575161 | toloraia | Reconstruction Project (JOI22_reconstruction) | C++14 | 3509 ms | 54164 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 <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
using namespace std;
const int N = 100005;
int n, m;
pair < int, pair < int, int > > P[N];
vector < int > g[505];
void del (int x, int y){
for (int i = 0; i < g[x].size(); i++){
if (g[x][i] == y){
swap (g[x][i], g[x].back());
g[x].pop_back();
break;
}
}
}
int G[505][505];
int par[505];
void dfs (int k, int p){
par[k] = p;
for (int to : g[k])
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... |