oj.uz

Submission #556138

# Submission time Handle Problem Language Result Execution time Memory
556138 2022-05-02T13:19:34 Z n0sk1ll Cave (IOI13_cave) C++14
0 / 100
 498 ms 400 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

int n;
bool vis[5005];
bool sta[5005];

int probaj(int l, int r, bool inv)
{
    int c[n];
    for (int i=0;i<l;i++) c[i]=inv;
    for (int i=l;i<=r;i++) c[i]=!inv;
    for (int i=r+1;i<n;i++) c[i]=inv;
    for (int i=0;i<n;i++) if (vis[i]) c[i]=sta[i];
    return tryCombination(c);
}

void exploreCave(int N)
{
    n=N;
    int s[n],d[n];

    for (int i=0;i<n;i++)
    {
        bool inv=0;
        int l=0,r=n-1;
        if (probaj(l,r,inv)==i) inv=1;
        while (l!=r)
        {
            int mid=(l+r)/2;
            if (probaj(l,mid,inv)==i) l=mid+1;
            else r=mid;
        }
        vis[l]=1;
        sta[l]=!inv;
        d[l]=i,s[l]=1;
    }

    answer(s,d);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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