제출 #790709

#제출 시각아이디문제언어결과실행 시간메모리
790709PoonYaPat커다란 상품 (IOI17_prize)C++14
0 / 100
11 ms9936 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int mmax=0,st,n,non_lol; vector<int> val[200005]; vector<int> none; int Ask(int x) { if (!val[x].size()) val[x]=ask(x); } void solve(int l, int r) { //l and r must be lolli_pop Ask(l); Ask(r); if (val[r][0]==val[l][0]) return; if (val[r][0]-val[l][0]==r-l-1) { for (int i=l+1; i<r; ++i) none.push_back(i); } else { int mid=(l+r)/2; Ask(mid); if (val[mid][0]+val[mid][1]!=mmax) { none.push_back(mid); for (int i=mid-1; i>l; --i) { Ask(i); if (val[i][0]+val[i][1]!=mmax) none.push_back(i); else { solve(l,i); break; } } for (int i=mid+1; i<r; ++i) { Ask(i); if (val[i][0]+val[i][1]!=mmax) none.push_back(i); else { solve(i,r); break; } } } else { solve(l,mid); solve(mid,r); } } } int find_best(int N) { n=N; for (int i=0; i<min(500,n); ++i) { val[i]=ask(i); mmax=max(mmax,val[i][0]+val[i][1]); } int st,ed; for (int i=0; i<n; ++i) { Ask(i); if (val[i][0]+val[i][1]!=mmax) none.push_back(i); else { st=i; break; } } for (int i=n-1; i>=0; --i) { Ask(i); if (val[i][0]+val[i][1]!=mmax) none.push_back(i); else { ed=i; break; } } solve(st,ed); solve(0,n-1); for (auto s : none) { Ask(s); if (val[s][0]+val[s][1]==0) return s; } }

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'int Ask(int)':
prize.cpp:11:1: warning: no return statement in function returning non-void [-Wreturn-type]
   11 | }
      | ^
prize.cpp: In function 'int find_best(int)':
prize.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type]
   84 | }
      | ^
prize.cpp:14:8: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   14 |     Ask(l);
      |     ~~~^~~
prize.cpp:58:9: note: 'st' was declared here
   58 |     int st,ed;
      |         ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...