oj.uz

Submission #984301

# Submission time Handle Problem Language Result Execution time Memory
984301 2024-05-16T12:55:09 Z stdfloat Cave (IOI13_cave) C++17
34 / 100
 10 ms 604 KB 
#include <bits/stdc++.h>
#include "cave.h"
//#include "grader.c"
using namespace std;

void exploreCave(int N) {
    int a[N], b[N];
    for (int i = 0; i < N; i++)
        a[i] = b[i] = 0;

    if (N <= (int)1e2) {
        while (true) {
            int x = tryCombination(a);

            if (x == -1) break;

            bool tr = false;
            for (int i = 0; i < N; i++) {
                if (a[i]) continue;

                a[i] = 1;

                int y = tryCombination(a);
                if (y == -1 || x < y) {
                    b[i] = x;
                    tr = true;
                    break;
                }

                a[i] = 0;
            }

            assert(tr);
        }

        for (int i = 0; i < N; i++) {
            if (!a[i]) {
                a[i] = 1;

                b[i] = tryCombination(a);
                
                a[i] = 0;
            }
        }
    }
    else {
        for (int i = 0; i < N; i++) {
            a[i] = 1;
            
            b[i] = tryCombination(a);
            
            a[i] = 0;
        }
    }

    /*sub1:
    for (int i = 0; i < N; i++)
        if (tryCombination(a) == i) a[i] = 1;

    iota(b, b + N, 0);

    */

    answer(a, b);
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 1 ms 348 KB Answer is wrong
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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