# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
563151 | Aktan | Swapping Cities (APIO20_swap) | C++14 | 132 ms | 19248 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 "swap.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
vector<int> e[100005];
int used[100005],mx=0;
bool h=0;
void dfs(int x,int p){
if(h==1){
return;
}
used[x]++;
if(used[x]==2){
h=1;
return;
}
for(auto w : e[x]){
if(used[w]<1 && w!=p){
dfs(w,x);
}
}
}
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W){
for(int i=0;i<M;i++){
e[U[i]].push_back(V[i]);
e[V[i]].push_back(U[i]);
# | 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... |