Submission #713846

#TimeUsernameProblemLanguageResultExecution timeMemory
713846AstraytHighway Tolls (IOI18_highway)C++17
5 / 100
17 ms1056 KiB
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
  	int M = U.size(), d = B - A;
	vector<int> w(M, 0), adj[N];
	for(int i = 0; i < M; ++i){
		adj[U[i]].pb(i);
		adj[V[i]].pb(i);
	}
	int S = -1, T = -1;
	long long toll = ask(w);
	for(int i = 0; i < N - 1; ++i){
		for(auto id:adj[i]){
			w[id] = 1;
		}
		long long cur = ask(w);
		if(cur - toll == d && S == -1){
			S = i;
		}else if(cur - toll == d) T = i;
		for(auto id:adj[i]){
			w[id] = 0;
		}
	}
	if(T == -1) T = N - 1;
  	answer(S, T);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...