# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42805 | alenam0161 | Simurgh (IOI17_simurgh) | C++14 | 2 ms | 432 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"
using namespace std;
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
std::vector<int> r(n - 1);
vector<int> ans;
for (int i = 0; i < u.size(); ++i) {
r.resize(0);
for (int j = 0; j < n - 1; ++j)r.push_back(i);
int k = count_common_roads(r);
if (k == n - 1)ans.push_back(i);
}
return ans;
}
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... |