제출 #72416

#제출 시각아이디문제언어결과실행 시간메모리
72416Kmcode커다란 상품 (IOI17_prize)C++14
0 / 100
3 ms372 KiB
#include<bits/stdc++.h> using namespace std; //#include "prize.h" #include <vector> int find_best(int n); std::vector<int> ask(int i); namespace solver{ map<int,pair<int,int> > mp; int fin; pair<int,int> query(int box){ if(box==-1){ return make_pair(0,-111); } if(mp.count(box))return mp[box]; cout<<"<script></script>"<<box<<endl; auto z=ask(box); if(z[0]==0&&z[1]==0){ fin=box; } return mp[box]=make_pair(z[0],z[1]); } inline void dfs(int l,int r){ int ex=query(r-1).first-query(l-1).first; int r_cn=query(r-1).first+query(r-1).second; int l_cn=query(l-1).first+query(l-1).second; if(r_cn==l_cn&&query(l-1).first+1==query(r).first)return; if(l+1==r)return; if(fin!=-1)return; dfs(l,(l+r)>>1); if(fin!=-1)return; dfs((l+r)>>1,r); } int find_best(int n) { fin=-1; dfs(0,n); return fin; } } int find_best(int n) { return solver::find_best(n); }

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

prize.cpp: In function 'void solver::dfs(int, int)':
prize.cpp:27:7: warning: unused variable 'ex' [-Wunused-variable]
   int ex=query(r-1).first-query(l-1).first;
       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...