# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68690 | mirbek01 | Simurgh (IOI17_simurgh) | C++17 | 3 ms | 412 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;
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
vector <int> ans;
int m = u.size();
for(int i = 0; i < n - 1; i ++)
ans.push_back(i);
int ct = count_common_roads(ans);
if(ct < n - 1){
for(int i = 0; i < ans.size(); i ++){
int cnt = count_common_roads(ans);
for(int j = n - 1; j < m; j ++){
int k = ans[i];
ans[i] = j;
int cn = count_common_roads(ans);
if(cn > cnt){
break;
}
ans[i] = k;
}
}
}
sort(ans.begin(), ans.end());
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... |