oj.uz

Submission #486481

# Submission time Handle Problem Language Result Execution time Memory
486481 2021-11-11T19:33:20 Z status_coding Cave (IOI13_cave) C++14
100 / 100
 458 ms 452 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

int N;

bool isOpen(int id, int v[])
{
    int ans = tryCombination(v);

    if(ans == -1 || ans > id)
        return true;
    return false;
}

int findPoz(int id, int curCol, int st, int dr, int col[], int qV[])
{
    if(st == dr)
        return st;

    int mij=(st+dr)/2;

    for(int i=0;i<N;i++)
    {
        if(col[i] != -1)
            qV[i]=col[i];
        else
            qV[i]=1-curCol;
    }
    for(int i=st;i<=mij;i++)
    {
        if(col[i] != -1)
            qV[i]=col[i];
        else
            qV[i]=curCol;
    }

    if(isOpen(id, qV))
        return findPoz(id, curCol, st, mij, col, qV);
    else
        return findPoz(id, curCol, mij+1, dr, col, qV);
}

void exploreCave(int n)
{
    N=n;
    int col[n];
    int id[n];
    int qV[n];

    for(int i=0;i<n;i++)
    {
        col[i]=-1;
        id[i]=-1;
    }

    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(col[j] != -1)
                qV[j]=col[j];
            else
                qV[j]=0;
        }

        int curCol = isOpen(i, qV) ? 0 : 1;
        int curPoz = findPoz(i, curCol, 0, n-1, col, qV);

        col[curPoz] = curCol;
        id[curPoz] = i;

        /*
        cout<<'\n';
        for(int i=0;i<n;i++)
            cout<<col[i]<<' ';
        cout<<'\n';

        for(int i=0;i<n;i++)
            cout<<id[i]<<' ';
        cout<<"\n\n";
        */
    }

    answer(col, id);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 332 KB Output is correct
2 Correct 246 ms 400 KB Output is correct
3 Correct 377 ms 416 KB Output is correct
4 Correct 247 ms 412 KB Output is correct
5 Correct 389 ms 416 KB Output is correct
6 Correct 367 ms 420 KB Output is correct
7 Correct 389 ms 420 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 372 ms 428 KB Output is correct
13 Correct 394 ms 416 KB Output is correct
14 Correct 366 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 380 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 385 ms 412 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 382 ms 332 KB Output is correct
7 Correct 394 ms 412 KB Output is correct
8 Correct 385 ms 416 KB Output is correct
9 Correct 395 ms 424 KB Output is correct
10 Correct 421 ms 332 KB Output is correct
11 Correct 386 ms 420 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 56 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 64 ms 332 KB Output is correct
24 Correct 54 ms 348 KB Output is correct
25 Correct 54 ms 336 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 292 KB Output is correct
28 Correct 54 ms 336 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 56 ms 332 KB Output is correct
31 Correct 65 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 420 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 58 ms 332 KB Output is correct
36 Correct 54 ms 336 KB Output is correct
37 Correct 0 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 332 KB Output is correct
2 Correct 246 ms 400 KB Output is correct
3 Correct 377 ms 416 KB Output is correct
4 Correct 247 ms 412 KB Output is correct
5 Correct 389 ms 416 KB Output is correct
6 Correct 367 ms 420 KB Output is correct
7 Correct 389 ms 420 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 372 ms 428 KB Output is correct
13 Correct 394 ms 416 KB Output is correct
14 Correct 366 ms 332 KB Output is correct
15 Correct 458 ms 380 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 385 ms 412 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 382 ms 332 KB Output is correct
21 Correct 394 ms 412 KB Output is correct
22 Correct 385 ms 416 KB Output is correct
23 Correct 395 ms 424 KB Output is correct
24 Correct 421 ms 332 KB Output is correct
25 Correct 386 ms 420 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 0 ms 300 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 296 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 56 ms 332 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 292 KB Output is correct
48 Correct 64 ms 332 KB Output is correct
49 Correct 54 ms 348 KB Output is correct
50 Correct 54 ms 336 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 292 KB Output is correct
53 Correct 54 ms 336 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 56 ms 332 KB Output is correct
56 Correct 65 ms 332 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 0 ms 420 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 58 ms 332 KB Output is correct
61 Correct 54 ms 336 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 252 ms 400 KB Output is correct
64 Correct 239 ms 396 KB Output is correct
65 Correct 371 ms 452 KB Output is correct
66 Correct 251 ms 404 KB Output is correct
67 Correct 373 ms 416 KB Output is correct
68 Correct 383 ms 332 KB Output is correct
69 Correct 373 ms 332 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 367 ms 332 KB Output is correct
73 Correct 367 ms 420 KB Output is correct
74 Correct 366 ms 436 KB Output is correct
75 Correct 370 ms 416 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 378 ms 428 KB Output is correct
79 Correct 370 ms 332 KB Output is correct
80 Correct 381 ms 420 KB Output is correct
81 Correct 381 ms 332 KB Output is correct
82 Correct 386 ms 432 KB Output is correct
83 Correct 369 ms 420 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 54 ms 332 KB Output is correct
86 Correct 363 ms 420 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 57 ms 336 KB Output is correct
90 Correct 54 ms 352 KB Output is correct
91 Correct 53 ms 352 KB Output is correct
92 Correct 383 ms 420 KB Output is correct
93 Correct 373 ms 332 KB Output is correct
94 Correct 381 ms 428 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 0 ms 204 KB Output is correct
97 Correct 367 ms 416 KB Output is correct
98 Correct 62 ms 352 KB Output is correct
99 Correct 372 ms 416 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 54 ms 340 KB Output is correct
102 Correct 53 ms 332 KB Output is correct
103 Correct 371 ms 420 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 54 ms 332 KB Output is correct
108 Correct 53 ms 352 KB Output is correct
109 Correct 385 ms 420 KB Output is correct
110 Correct 382 ms 428 KB Output is correct
111 Correct 0 ms 204 KB Output is correct