| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 293666 | Dovran | Highway Tolls (IOI18_highway) | C++11 | 0 ms | 0 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 "highway.h"
#define N 200009
#define pii pair <int, int>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
int n, m, l[N], qwe, a;
vector<int>e[N];
vector<int>asd;
ll x;
int c[N][N];
void f(int nd, int lv){
for(int i=0; i<e[nd].size(); i++){
if(lv==x-1){
asd[c[nd][i]]=1;
int y=ask(asd);
if(x*a!=y){
answer(0, nd);
qwe=1;
return;
}
}
if(!l[e[nd][i]] and e[nd][i]>0)
f(e[nd][i], lv+1);
if(qwe)
return;
}
}
void find_pair(int NN, std::vector<int>u, std::vector<int>v, int A, int b){
n=NN;
m=u.size();
a=A;
for(int i=0; i<m; i++){
e[u[i]].pb(v[i]);
e[v[i]].pb(u[i]);
c[v[i]][u[i]]=i;
c[u[i]][v[i]]=i;
asd.pb(0);
}
if(a>b)
swap(a, b);
x=ask(asd);
x=x/a;
f(0, 0);
}