# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427085 | 2021-06-14T12:17:53 Z | A_D | Simurgh (IOI17_simurgh) | C++14 | 1 ms | 204 KB |
#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){ return; } 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); sort(ret.begin(),ret.end()); return ret; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | correct |
2 | Incorrect | 1 ms | 204 KB | WA in grader: NO |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |