제출 #354312

#제출 시각아이디문제언어결과실행 시간메모리
354312David_M동굴 (IOI13_cave)C++14
0 / 100
115 ms620 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; int c[5003],f[5003],a[5003],i,j,x,l,r,m,e; void A(int L,int R){for(;R>=L;R--)c[R]^=(!f[R]);} int T(){e=tryCombination(c);return e<=i&&e!=1;} void exploreCave(int N){ for(;i<N;i++){ l=0,r=N-1; if(T())A(0,N-1); while(l<r){m=l+r>>1;A(l,m);if(T()){r=m;A(l,m);}else{A(l,m);l=m+1;}} a[l]=i,f[l]=1; }answer(c,a); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:11:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |      while(l<r){m=l+r>>1;A(l,m);if(T()){r=m;A(l,m);}else{A(l,m);l=m+1;}}
      |                   ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...