Submission #821573

#TimeUsernameProblemLanguageResultExecution timeMemory
821573Dan4LifeHighway Tolls (IOI18_highway)C++17
6 / 100
99 ms6860 KiB
#include "highway.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; #define pb push_back #define sz(a) (int)a.size() #define all(a) begin(a),end(a) const int mxN = (int)2e5+10; using ll = long long; vector<pair<int,int>> adj[mxN]; int n, m, dist, dis[mxN]; void find_pair(int N, vi u, vi v, int A, int B) { n = N; m = sz(u); vi w(m,0); ll toll = ask(w); int l = 0, r = m-1; while(l<r){ int mid = (l+r)/2; fill(all(w),0); fill(begin(w),begin(w)+mid+1,1); if(ask(w)!=toll) r=mid; else l=mid+1; } int x = l; l = 0, r = m-1; while(l<r){ int mid = (l+r+1)/2; fill(all(w),0); fill(begin(w)+mid,end(w),1); if(ask(w)!=toll) l=mid; else r=mid-1; } answer(x,l+1); }
#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...