oj.uz

Submission #305876

# Submission time Handle Problem Language Result Execution time Memory
305876 2020-09-24T04:08:21 Z juggernaut Cave (IOI13_cave) C++14
0 / 100
 350 ms 504 KB 
#include"cave.h"
#include<bits/stdc++.h>
using namespace std;
int pos[5000],n,tmp[5000],bl[5000],ans[5000],pr;
bool check(int val,int l,int r){
    for(int i=l;i<=r;i++)if(!bl[i])ans[i]^=1;
    int ret=tryCombination(tmp);
    l=pr;
    pr=ret;
    return (l>=val)^(ret>=val);
}
void exploreCave(int N){
    int i=0,l,r,m;
    n=N;
    for(;i<n;i++){
        l=0,r=n-1;
        pr=tryCombination(ans);
        while(l<r){
            m=(l+r)>>1;
            if(check(i,l,m))r=m;
            else l=m+1;
        }
        if(pr>=i)ans[i]^=1;
        pos[i]=l;
        bl[i]=1;
    }
    answer(ans,pos);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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