| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 613833 | Mr_Husanboy | Simurgh (IOI17_simurgh) | C++14 | 5 ms | 320 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;
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define ff first
#define ss second
vector<pair<int,int>> g[1005];
vector<int> find_roads(int n, vector<int> u, vector<int> v) {
int m = u.size();
for(int i = 0; i <(1<<m); i++){
vector<int> tem;
vector<int> vis(n);
for(int j = 0; j < m; j++){
if(i & (1 << j)){
tem.push_back(j); vis[u[j]] = vis[v[j]] = 1;
}
}
int cnt = 0;
for(auto u : vis) cnt += u;
if(tem.size() == n-1 && cnt == n){
//cout << "H " << endl;
// for(auto u:tem) cout << u << ' '; cout << endl;
if(count_common_roads(tem) == n-1) return tem;
}
}
}
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... | ||||
