제출 #991615

#제출 시각아이디문제언어결과실행 시간메모리
991615yeediot동굴 (IOI13_cave)C++17
0 / 100
176 ms532 KiB
#include<bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int n){ int s[n], d[n], cur[n]; bool done[n]; memset(done, 0, sizeof(done)); memset(cur, 0, sizeof(cur)); for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(!done[j]){ cur[j] ^= 1; } } int pos = tryCombination(cur); bool flag = 1; if(pos > i){ flag = 0; } int l = 0, r = n-1; while(l < r){ int mm = l+r >> 1; for(int j=l;j<=mm;j++){ if(!done[j]) cur[j] = flag; } pos = tryCombination(cur); for(int j=l;j<=mm;j++){ if(!done[j]) cur[j] = !flag; } if(pos > i) { r = mm; } else{ l = mm+1; } } d[i] = l; s[i] = flag; done[l] = 1; } answer(d, s); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:22:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |             int mm = 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...