제출 #347619

#제출 시각아이디문제언어결과실행 시간메모리
347619beksultan04커다란 상품 (IOI17_prize)C++14
0 / 100
1 ms364 KiB
#include "prize.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; #define lol long long #define pii pair<int,int> #define OK puts("OK"); #define NO puts("NO"); #define YES puts("YES"); #define fr first #define sc second #define ret return #define scanl(a) scanf("%lld",&a); #define scanll(a,b) scanf("%lld %lld",&a, &b); #define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c); #define scan1(a) scanf("%d",&a); #define scan2(a,b) scanf("%d %d",&a, &b); #define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c); #define all(s) s.begin(),s.end() #define allr(s) s.rbegin()Ñ,s.rend() #define pb push_back #define sz(v) (int)v.size() #define endi puts(""); #define eps 1e-12 const int N = 3e5+12,INF=1e9+7; int find_best(int n) { int mx=0,i,ll=0,rr=n-1; while (ll < rr){ vector <int> x = ask(ll); mx = max(mx,x[0]+x[1]); if (mx == (x[0]+x[1])){ int l = ll,r = rr; while (r >= l){ int m = l+r>>1; vector <int> y = ask(m); if (y == x){ ll = m; l = m+1; } else r = m-1; } } vector <int> y = ask(rr); mx = max(mx,y[0]+y[1]); if (mx == (y[0]+y[1])){ int l = ll,r = rr; while (r >= l){ int m = l+r>>1; vector <int> z = ask(m); if (y == z){ rr = m; r = m-1; } else l = m+1; } } ll++; rr--; } ret ll; }

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:34:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |                 int m = l+r>>1;
      |                         ~^~
prize.cpp:51:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |                 int m = l+r>>1;
      |                         ~^~
prize.cpp:27:14: warning: unused variable 'i' [-Wunused-variable]
   27 |     int mx=0,i,ll=0,rr=n-1;
      |              ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...