제출 #742822

#제출 시각아이디문제언어결과실행 시간메모리
742822Dulguun동굴 (IOI13_cave)C++11
0 / 100
44 ms420 KiB
#include<bits/stdc++.h> #include "cave.h". using namespace std; typedef long long ll; int cur=0; void exploreCave(int n){ int s[n], d[n]; for(int &i: s) i=0; while(cur<n){ int exp, mid, l=0, r=n-1; while(l<r){ if(l==r){ d[l]=cur++; break; } mid = (l+r)/2; for(int i=l; i<=mid; s[i++]^=1); exp = tryCombination(s); if(exp>cur || exp==-1) r=mid; else l=mid+1; for(int i=l; i<=mid; s[i++]^=1); } } answer(s,d); }

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

cave.cpp:2:18: warning: extra tokens at end of #include directive
    2 | #include "cave.h".
      |                  ^
#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...