제출 #371383

#제출 시각아이디문제언어결과실행 시간메모리
371383leinad2커다란 상품 (IOI17_prize)C++17
0 / 100
3044 ms364 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int A[200010]; int find_best(int n) {if(n==200000)for(;;); while(1) { int a=0, b=n-1; while(a<b) { int m=a+b>>1; vector<int>v=ask(m); if(v[0]+v[1]==0)return m; if(v[1]>A[m+1])a=m+1; else b=m; } vector<int>v=ask(a); if(v[0]+v[1]==0)return a; for(int i=0;i++<a;)A[i]++; } }

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:6:15: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    6 | {if(n==200000)for(;;);
      |               ^~~
prize.cpp:7:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    7 |     while(1)
      |     ^~~~~
prize.cpp:12:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |             int m=a+b>>1;
      |                   ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...