# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005837 | irmuun | Highway Tolls (IOI18_highway) | C++17 | 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"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
void find_pair(int n,vector<int>u,vector<int>v,int A, int B){
int m=u.size();
vector<int>w(m,0);
vector<pair<int,int>>adj[n];
for(int i=0;i<m;i++){
adj[u[i]].pb({v[i],i});
adj[v[i]].pb({u[i],i});
}
ll C=ask(w);
for(int t=1;t<n;t++){
for(auto [_,i]:adj[t]){
w[i]=1;
}
ll cost=ask(w);
if(cost==C-a+b){
answer(0,t);
return;
}
}
return;
}