Submission #143192

#TimeUsernameProblemLanguageResultExecution timeMemory
143192nekiHighway Tolls (IOI18_highway)C++14
0 / 100
26 ms632 KiB
#include "highway.h" #include <bits/stdc++.h> #define loop(i, a, b) for(int i=a;i<b;i++) using namespace std; typedef long long ll; void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) { ll M=U.size(), st=0; vector<int> arr;arr.resize(M, 0);ll req=ask(arr); while(st<M){ ll l=st, r=M; while(l<r){ ll mid=(l+r)/2; loop(i, st, M) arr[i]=(i<=mid); if(ask(arr)==req) l=mid+1; else r=mid; } arr[l]=0;st=l+1; } vector<int> temp(N, 0), ans; loop(i, 0, M) if(!arr[i]) temp[U[i]]++,temp[V[i]]++; loop(i, 0, N) if(temp[i]==1) ans.push_back(i); answer(ans[0], ans[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...