# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427079 | A_D | Simurgh (IOI17_simurgh) | C++14 | 1 ms | 292 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;
void bc(int i)
{
// cout<<i<<endl;
if(vec.size()>mm){
return;
}
if(i==nn){
if(vec.size()==mm){
int ans=count_common_roads(vec);
if(ans==mm)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){
nn=u.size();
mm=N-1;
bc(0);
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... |