#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[90000];
int dist1[90000], dist2[90000];
bool chk[90000];
void find_pair(int N, vector<int> U, vector<int> V, int A, int B)
{
int M=U.size(), S, T, s, e, E;
vector<int> W(M,0), C1, C2;
queue<int> Q;
long long D=ask(W);
for(int i=0;i<M;i++) {
adj[U[i]].push_back(V[i]);
adj[V[i]].push_back(U[i]);
}
s=0; e=N-1;
while(s<=e) {
int m=(s+e)>>1;
for(int i=0;i<N;i++) W[i]=i<=m;
if(ask(W)!=D) e=m-1;
else s=m+1;
}
E=s;
memset(dist1,0x7f,sizeof(dist1));
memset(dist2,0x7f,sizeof(dist2));
dist1[U[E]]=0; Q.push(U[E]);
while(!Q.empty()) {
int c=Q.front();
Q.pop();
for(auto n: adj[c]) if(dist1[n]>dist1[c]+1) {
dist1[n]=dist1[c]+1;
Q.push(n);
}
}
dist2[V[E]]=0; Q.push(V[E]);
while(!Q.empty()) {
int c=Q.front();
Q.pop();
for(auto n: adj[c]) if(dist2[n]>dist2[c]+1) {
dist2[n]=dist2[c]+1;
Q.push(n);
}
}
s=0; e=D/A-1;
while(s<=e) {
int m=(s+e)>>1;
for(int i=0;i<M;i++) W[i]=(dist1[U[i]]<dist2[U[i]] && dist1[U[i]]>=m)^(dist1[V[i]]<dist2[V[i]] && dist1[V[i]]>=m);
if(ask(W)!=D) s=m+1;
else e=m-1;
}
tout<<s<<'\n';
for(int i=0;i<N;i++) {
if(dist1[i]<dist2[i] && dist1[i]==e) C1.push_back(i);
if(dist1[i]>dist2[i] && dist2[i]==D/A-s) C2.push_back(i);
chk[i]=false;
}
s=0; e=C1.size()-1;
while(s<=e) {
int m=(s+e)>>1;
for(int i=0;i<N;i++) chk[i]=false;
for(int i=0;i<=m;i++) chk[C1[i]]=true;
for(int i=0;i<M;i++) W[i]=chk[U[i]] || chk[V[i]];
if(ask(W)!=D) e=m-1;
else s=m+1;
}
S=C1[s];
s=0; e=C2.size()-1;
while(s<=e) {
int m=(s+e)>>1;
for(int i=0;i<N;i++) chk[i]=false;
for(int i=0;i<=m;i++) chk[C2[i]]=true;
for(int i=0;i<M;i++) W[i]=chk[U[i]] || chk[V[i]];
if(ask(W)!=D) e=m-1;
else s=m+1;
}
T=C2[s];
answer(S,T);
}
Compilation message
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:55:2: error: 'tout' was not declared in this scope
tout<<s<<'\n';
^~~~
highway.cpp:55:2: note: suggested alternative: 'stdout'
tout<<s<<'\n';
^~~~
stdout
