Submission #114505

#TimeUsernameProblemLanguageResultExecution timeMemory
114505tinjyu통행료 (IOI18_highway)C++14
0 / 100
30 ms4840 KiB
#include "highway.h" #include <iostream> using namespace std; int m,ans[1000005]; int find(int s,int e) { std::vector<int> w(m); for(int i=0;i<=m;i++) { w[i] = 0; } for(int i=s;i<=e;i++) { w[i]=1; } int t=ask(w); if(t==e-s+1) { for(int i=s;i<=e;i++) { ans[0]++; ans[ans[0]]=i; } } else if(t==0)return 0; else { find(s,(s+e)/2); find((s+e)/2,e); } } void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) { m = U.size(); find(0,m); int s=N+1,t=0; for(int i=1;i<=ans[0];i++) { s=min(ans[i],s); t=max(ans[i]+1,t); } answer(s, t); }

Compilation message (stderr)

highway.cpp: In function 'int find(int, int)':
highway.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...