# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42948 | MatheusLealV | Simurgh (IOI17_simurgh) | C++14 | 2 ms | 480 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 <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(count_common_roads(aux) == n - 1) return aux;
}
}
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... |