제출 #305867

#제출 시각아이디문제언어결과실행 시간메모리
305867juggernaut동굴 (IOI13_cave)C++14
13 / 100
22 ms452 KiB
#include"cave.h" #include<bits/stdc++.h> using namespace std; int pos[5000],n,tmp[5000]; bool check(int val,int l,int r){ for(int i=0;i<n;i++)tmp[i]=(pos[i]||(l<=i&&i<=r))?1:0; int ret=tryCombination(tmp); if(ret==-1)ret=n; return ret>val; } void exploreCave(int N){ int i=0,l,r,m; n=N; for(;i<n;i++){ // l=0,r=n-1; // while(l<r){ // m=(l+r)>>1; // if(check(i,l,m))r=m; // else l=m+1; // } // pos[l]=i; tmp[i]=1; m=tryCombination(tmp); pos[i]=m; tmp[i]=0; } // memset(tmp,0,sizeof(tmp)); answer(tmp,pos); }

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:12:13: warning: unused variable 'l' [-Wunused-variable]
   12 |     int i=0,l,r,m;
      |             ^
cave.cpp:12:15: warning: unused variable 'r' [-Wunused-variable]
   12 |     int i=0,l,r,m;
      |               ^
#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...