제출 #619139

#제출 시각아이디문제언어결과실행 시간메모리
619139SlavicG커다란 상품 (IOI17_prize)C++17
20 / 100
81 ms336 KiB
#include "prize.h" #include "bits/stdc++.h" using namespace std; int ans = -1; vector<int> query(int i) { //if(mp.count(i)) return mp[i]; vector<int> paiu = ask(i); return paiu; } void rec(int l, int r) { if(l > r) return; if(l == r) { if(query(l)[0] + query(l)[1] == 0) { ans = l; } return; } if(query(r)[0] == query(l)[0] && query(r)[1] == query(l)[1]) return; int mid = l + r >> 1; if(query(mid)[0] + query(mid)[1] == 0) { ans = mid; return; } rec(l, mid - 1); rec(mid + 1, r); } int find_best(int n) { ans = -1; rec(0, n - 1); return ans; }

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

prize.cpp: In function 'void rec(int, int)':
prize.cpp:21:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     int mid = l + r >> 1;
      |               ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...