# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42949 | 2018-03-06T19:36:36 Z | MatheusLealV | Simurgh (IOI17_simurgh) | C++14 | 5 ms | 480 KB |
#include <bits/stdc++.h> #include "simurgh.h" using namespace std; int n, m; vector<int> find_roads(int n_, vector<int> u, vector<int> v) { n = n_; m = u.size(); for(int mask = 0; mask < (1<<m); mask ++) { vector<int> aux; for(int i = 0; i < m; i++) { if(mask & (1<<i)) { aux.push_back(i); } } if(aux.size() == n - 1 && count_common_roads(aux) == n - 1) return aux; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 248 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 248 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 248 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 480 KB | correct |
2 | Incorrect | 5 ms | 480 KB | WA in grader: NO |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 248 KB | WA in grader: NO |
2 | Halted | 0 ms | 0 KB | - |