oj.uz

Submission #305863

# Submission time Handle Problem Language Result Execution time Memory
305863 2020-09-24T03:36:11 Z juggernaut Cave (IOI13_cave) C++14
0 / 100
 572 ms 504 KB 
#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);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:12:17: warning: unused variable 'm' [-Wunused-variable]
   12 |     int i=0,l,r,m;
      |                 ^

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 248 ms 504 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 572 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 248 ms 504 KB Answer is wrong
2 Halted 0 ms 0 KB -