# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073587 | vjudge1 | Simurgh (IOI17_simurgh) | C++17 | 325 ms | 592 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;
vector<vector<int>>adj(505);
vector<bool> vis(505,0);
void DFS(int n){
vis[n] = 1;
for(auto x: adj[n]){
if(vis[x])continue;
DFS(x);
}
}
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
vector<pair<int,int>> edges;
for(int i=0; i < u.size(); i++){
edges.push_back({u[i],v[i]});
}
for(int b=0; b < (1<<edges.size()); b++){
vector<int> r;
for(int i=0; i < n; i++){
adj[i].clear();
vis[i] = 0;
}
for(int i=0; i < edges.size(); i++){
if(b & (1<<i)){
adj[edges[i].first].push_back(edges[i].second);
adj[edges[i].second].push_back(edges[i].first);
r.push_back(i);
}
}
if(r.size() != n-1){
continue;
}
DFS(0);
int cnt = 0;
for(int i=0; i < n; i++){
if(vis[i]){
cnt++;
}else{
break;
}
}
int aux;
if(cnt == n){
aux = count_common_roads(r);
}else{
continue;
}
if(aux == n-1){
return r;
}
}
return {0};
}
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... |