제출 #352442

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

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

cave.cpp: In function 'int T()':
cave.cpp:6:33: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
    6 | int T(){return tryCombination(c)+8192&8191;}
      |                ~~~~~~~~~~~~~~~~~^~~~~
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:12:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |       m=l+r>>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...