oj.uz

Submission #556146

# Submission time Handle Problem Language Result Execution time Memory
556146 2022-05-02T13:38:25 Z n0sk1ll Cave (IOI13_cave) C++14
25 / 100
 935 ms 408 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 dobar)
{
    int c[n];
    for (int i=0;i<l;i++) c[i]=!dobar;
    for (int i=l;i<=r;i++) c[i]=dobar;
    for (int i=r+1;i<n;i++) c[i]=!dobar;
    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 dobar=1;
        int l=0,r=n-1;
        if (probaj(l,r,dobar)==i) dobar=0;
        while (l!=r)
        {
            int mid=(l+r)/2;
            if (probaj(l,mid,dobar)==i) l=mid+1;
            else r=mid;
        }
        vis[l]=1;
        sta[l]=dobar;
        d[l]=i,s[l]=sta[i];
    }

    answer(s,d);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 384 KB Output is correct
2 Correct 314 ms 340 KB Output is correct
3 Correct 457 ms 396 KB Output is correct
4 Correct 326 ms 392 KB Output is correct
5 Correct 440 ms 400 KB Output is correct
6 Correct 458 ms 396 KB Output is correct
7 Correct 449 ms 396 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 457 ms 400 KB Output is correct
13 Correct 439 ms 400 KB Output is correct
14 Correct 473 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 400 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 471 ms 400 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 473 ms 396 KB Output is correct
7 Correct 476 ms 400 KB Output is correct
8 Correct 933 ms 400 KB Output is correct
9 Correct 920 ms 404 KB Output is correct
10 Correct 935 ms 396 KB Output is correct
11 Correct 477 ms 408 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 384 KB Output is correct
2 Correct 314 ms 340 KB Output is correct
3 Correct 457 ms 396 KB Output is correct
4 Correct 326 ms 392 KB Output is correct
5 Correct 440 ms 400 KB Output is correct
6 Correct 458 ms 396 KB Output is correct
7 Correct 449 ms 396 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 457 ms 400 KB Output is correct
13 Correct 439 ms 400 KB Output is correct
14 Correct 473 ms 340 KB Output is correct
15 Correct 448 ms 400 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 471 ms 400 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 473 ms 396 KB Output is correct
21 Correct 476 ms 400 KB Output is correct
22 Correct 933 ms 400 KB Output is correct
23 Correct 920 ms 404 KB Output is correct
24 Correct 935 ms 396 KB Output is correct
25 Correct 477 ms 408 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Incorrect 1 ms 212 KB Answer is wrong
31 Halted 0 ms 0 KB -