oj.uz

Submission #1091513

# Submission time Handle Problem Language Result Execution time Memory
1091513 2024-09-21T04:36:38 Z AndreasK Cave (IOI13_cave) C++14
13 / 100
 9 ms 528 KB 
#include <bits/stdc++.h>
#include <cave.h>
using namespace std;

#define designed ios_base::sync_with_stdio(0);
#define by cin.tie(0);
#define AndreasK cout.tie(0);
//#define int long long
#define ii pair <int, int>
#define vi vector <int>
#define iii pair <int, ii>
#define vii vector <ii>
#define vc vector <char>
#define vb vector <bool>

void exploreCave(int n) {
    int s[n] = {}, d[n];
    int x = tryCombination(s);
    int curr = 0;
    while (x != -1) {
        int xprev = x;
        s[curr] ^= 1;
        x = tryCombination(s);
        if (x == -1)
            break;
        else if (x <= xprev) {
            s[curr] ^= 1;
        }
        curr++;
        curr %= n;
    }
    for (int c = 0; c < n; c++) {
        s[c] ^= 1;
        x = tryCombination(s);
        s[c] ^= 1;
        d[c] = x;
    }
    answer(s, d);
}

/*
int32_t main() {
    designed by AndreasK

    return 0;
}*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 9 ms 528 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 344 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 344 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB too much calls on tryCombination()
8 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB too much calls on tryCombination()
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -