oj.uz

Submission #302314

# Submission time Handle Problem Language Result Execution time Memory
302314 2020-09-18T15:33:38 Z JovanK26 Cave (IOI13_cave) C++14
0 / 100
 153 ms 632 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

int n,cur;
int s[5001];
int d[5001];
bool vis[5001];
bool check(int x,int y)
{
    for(int i=x;i<=y;i++)
    {
        if(vis[i])continue;
        s[i]=!s[i];
    }
    int q=tryCombination(s);
    for(int i=x;i<=y;i++)
    {
        if(vis[i])continue;
        s[i]=!s[i];
    }
    if(q>cur || q==-1)return 1;
    return 0;
}
void exploreCave(int N)
{
    n=N;
    for(int i=0;i<n;i++)
    {
        cur=i;
        int q=tryCombination(s);
        if(q>cur || cur==-1)
        {
            for(int j=0;j<n;j++)
            {
                if(vis[j])continue;
                s[j]=!s[j];
            }
        }
        int l=0;
        int r=n-1;
        int m;
        while(l<r)
        {
           m=(l+r)/2;
           if(check(l,m))
           {
               r=m;
           }
           else
           {
               l=m+1;
           }
        }
        vis[r]=1;
        d[i]=r;
        s[r]=!s[r];
    }
    answer(s,d) ;
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 51 ms 384 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 153 ms 632 KB Answer is wrong
2 Halted 0 ms 0 KB -