제출 #305862

#제출 시각아이디문제언어결과실행 시간메모리
305862juggernautCave (IOI13_cave)C++14
0 / 100
560 ms504 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){
            int m=(l+r)>>1;
            if(check(i,l,m))r=m;
            else l=m+1;
        }
        pos[l]=i;
    }
    memset(tmp,0,sizeof(tmp));
    answer(tmp,pos);
}

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:12:17: warning: unused variable 'm' [-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...