제출 #905346

#제출 시각아이디문제언어결과실행 시간메모리
905346nightfalThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms596 KiB
//#include "prize.h" #include <iostream> #include <vector> #include <algorithm> using namespace std; static const int max_q = 10000; static int n; static int query_count = 0; static vector<int> g; static vector<vector<int> > rank_count; int find_best(int n); std::vector<int> ask(int i); int subtask1(int n){ int start=0, end=n-1; while (start<end) { int mid = (start+end)/2; vector<int> ans = ask(mid); if (!ans[0] && !ans[1]) return mid; else if (!ans[0]) start=mid+1; else end = mid-1; } return start; } int find_best(int n) { return subtask1(n); for(int i = 0; i < n; i++) { std::vector<int> res = ask(i); if(res[0] + res[1] == 0) return i; } return 0; }

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

prize.cpp:10:12: warning: 'query_count' defined but not used [-Wunused-variable]
   10 | static int query_count = 0;
      |            ^~~~~~~~~~~
prize.cpp:9:12: warning: 'n' defined but not used [-Wunused-variable]
    9 | static int n;
      |            ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...