| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 427115 | A_D | Simurgh (IOI17_simurgh) | C++14 | 3092 ms | 204 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 nn,mm;
vector<int> ret;
vector<int> vec;
vector<int> vec2;
void bc(int i)
{
if(i==mm){
if(vec.size()==nn-1){
vec2=vec;
int ans=count_common_roads(vec2);
if(ans==nn-1)ret=vec;
}
return;
}
vec.push_back(i);
bc(i+1);
vec.pop_back();
bc(i+1);
}
vector<int> find_roads(int n,vector<int> u,vector<int> v){
ret.clear();vec.clear();
nn=n;
mm=u.size();
bc(0);
sort(ret.begin(),ret.end());
return ret;
}
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... | ||||
