oj.uz

Submission #951342

# Submission time Handle Problem Language Result Execution time Memory
951342 2024-03-21T15:53:28 Z quanlt206 Cave (IOI13_cave) C++17
46 / 100
 14 ms 556 KB 
#include "cave.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 5e3 + 7;

int n, s[N], d[N];

int a[N], b[N];

void subtask_1() {
    REP(i, 0, n) a[i] = i, b[i] = 0;
    REP(i, 0, n) {
        int val = tryCombination(b);
        if (val > i || val == -1) continue;
        b[i]^=1;
    }
    if (tryCombination(b) != -1) return ;
    answer(b, a);
    exit(0);
}

void subtask_2() {
    REP(i, 0, n) b[i] = 0;
    if (tryCombination(b) != -1) return ;
    REP(i, 0, n) {
        b[i]^=1;
        int vcl = tryCombination(b);
        a[i] = vcl;
        b[i]^=1;
    }
    answer(b, a);
    exit(0);
}

void subtask_3() {
    REP(i, 0, n) b[i] = 0;
    int tmp = tryCombination(b);
    while (tmp != -1) {
        REP(j, 0, n) {
            b[j]^=1;
            int vcl = tryCombination(b);
            if (vcl == -1 || vcl > tmp) {
                tmp = vcl;
                break;
            }
            b[j]^=1;
        }
    }
    REP(i, 0, n) {
        b[i]^=1;
        int vcl = tryCombination(b);
        a[i] = vcl;
        b[i]^=1;
    }
    answer(b, a);
    exit(0);
}

void exploreCave(int N) {
    n = N;
    if (n <= 100) {
        subtask_3();
        return ;
    }
    subtask_2();
    subtask_1();
    return ;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 8 ms 524 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 8 ms 348 KB Output is correct
9 Correct 12 ms 348 KB Output is correct
10 Correct 9 ms 556 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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 344 KB Output is correct
8 Correct 1 ms 544 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 344 KB Output is correct
8 Correct 1 ms 544 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 0 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() 함수를 반드시 호출해야 합니다.
21 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Correct 8 ms 532 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 8 ms 528 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 8 ms 524 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 8 ms 348 KB Output is correct
21 Correct 8 ms 348 KB Output is correct
22 Correct 8 ms 348 KB Output is correct
23 Correct 12 ms 348 KB Output is correct
24 Correct 9 ms 556 KB Output is correct
25 Correct 8 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 544 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Incorrect 1 ms 348 KB answer() 함수를 반드시 호출해야 합니다.
46 Halted 0 ms 0 KB -