oj.uz

Submission #951349

# Submission time Handle Problem Language Result Execution time Memory
951349 2024-03-21T16:21:38 Z quanlt206 Cave (IOI13_cave) C++17
100 / 100
 259 ms 1104 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);
}

bool hasAns[N];

void subtask_full() {
    REP(i, 0, n) b[i] = 0, hasAns[i] = false;
    REP(stt, 0, n) {
        REP(i, 0, n)
            if (!hasAns[i]) b[i] = 0;
        int val = tryCombination(b);
        int bit = 0;
        if (!(val == -1 || val > stt)) {
            bit^=1;
            REP(i, 0, n)
                if (!hasAns[i]) b[i]^=1;
        }
        vector<int> rem;
        REP(i, 0, n)
            if (!hasAns[i]) rem.push_back(i);
        int d = 0, c = (int)rem.size() - 1, g;
        while (d < c) {
            g = (d + c) >> 1;
            // flip bit tu d -> g
            FOR(i, d, g)
                if (!hasAns[rem[i]]) b[rem[i]]^=1;
            int tmp = tryCombination(b);
            if (tmp == -1 || tmp > stt) d = g + 1; else {
                FOR(i, d, c)
                    if (!hasAns[rem[i]]) b[rem[i]]^=1;
                c = g;
            }
        }
        int idx = rem[d];
        a[rem[d]] = stt;
        hasAns[rem[d]] = true;
    }
    answer(b, a);
}

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

Compilation message

cave.cpp: In function 'void subtask_full()':
cave.cpp:128:13: warning: unused variable 'idx' [-Wunused-variable]
  128 |         int idx = rem[d];
      |             ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 348 KB Output is correct
2 Correct 133 ms 572 KB Output is correct
3 Correct 194 ms 560 KB Output is correct
4 Correct 133 ms 564 KB Output is correct
5 Correct 189 ms 572 KB Output is correct
6 Correct 187 ms 568 KB Output is correct
7 Correct 185 ms 344 KB Output is correct
8 Correct 1 ms 348 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 187 ms 560 KB Output is correct
13 Correct 187 ms 560 KB Output is correct
14 Correct 190 ms 564 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 178 ms 572 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 186 ms 592 KB Output is correct
7 Correct 174 ms 572 KB Output is correct
8 Correct 231 ms 348 KB Output is correct
9 Correct 232 ms 592 KB Output is correct
10 Correct 232 ms 348 KB Output is correct
11 Correct 170 ms 344 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 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 1 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 1 ms 348 KB Output is correct
20 Correct 27 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 34 ms 348 KB Output is correct
24 Correct 35 ms 344 KB Output is correct
25 Correct 34 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 35 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 26 ms 524 KB Output is correct
31 Correct 26 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 444 KB Output is correct
35 Correct 36 ms 348 KB Output is correct
36 Correct 36 ms 600 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 348 KB Output is correct
2 Correct 133 ms 572 KB Output is correct
3 Correct 194 ms 560 KB Output is correct
4 Correct 133 ms 564 KB Output is correct
5 Correct 189 ms 572 KB Output is correct
6 Correct 187 ms 568 KB Output is correct
7 Correct 185 ms 344 KB Output is correct
8 Correct 1 ms 348 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 187 ms 560 KB Output is correct
13 Correct 187 ms 560 KB Output is correct
14 Correct 190 ms 564 KB Output is correct
15 Correct 186 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 178 ms 572 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 186 ms 592 KB Output is correct
21 Correct 174 ms 572 KB Output is correct
22 Correct 231 ms 348 KB Output is correct
23 Correct 232 ms 592 KB Output is correct
24 Correct 232 ms 348 KB Output is correct
25 Correct 170 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 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 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 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 1 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 1 ms 348 KB Output is correct
45 Correct 27 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 34 ms 348 KB Output is correct
49 Correct 35 ms 344 KB Output is correct
50 Correct 34 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 35 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 26 ms 524 KB Output is correct
56 Correct 26 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 444 KB Output is correct
60 Correct 36 ms 348 KB Output is correct
61 Correct 36 ms 600 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 125 ms 564 KB Output is correct
64 Correct 133 ms 600 KB Output is correct
65 Correct 195 ms 604 KB Output is correct
66 Correct 140 ms 600 KB Output is correct
67 Correct 190 ms 604 KB Output is correct
68 Correct 187 ms 604 KB Output is correct
69 Correct 185 ms 600 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 187 ms 604 KB Output is correct
73 Correct 190 ms 1104 KB Output is correct
74 Correct 187 ms 600 KB Output is correct
75 Correct 175 ms 608 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 192 ms 624 KB Output is correct
79 Correct 176 ms 604 KB Output is correct
80 Correct 237 ms 608 KB Output is correct
81 Correct 230 ms 604 KB Output is correct
82 Correct 232 ms 856 KB Output is correct
83 Correct 173 ms 848 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 27 ms 528 KB Output is correct
86 Correct 170 ms 604 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 34 ms 348 KB Output is correct
90 Correct 36 ms 764 KB Output is correct
91 Correct 35 ms 348 KB Output is correct
92 Correct 259 ms 608 KB Output is correct
93 Correct 258 ms 600 KB Output is correct
94 Correct 257 ms 612 KB Output is correct
95 Correct 1 ms 544 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 173 ms 612 KB Output is correct
98 Correct 29 ms 348 KB Output is correct
99 Correct 191 ms 608 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 27 ms 528 KB Output is correct
102 Correct 26 ms 532 KB Output is correct
103 Correct 169 ms 604 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 1 ms 344 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 34 ms 348 KB Output is correct
108 Correct 32 ms 344 KB Output is correct
109 Correct 255 ms 608 KB Output is correct
110 Correct 233 ms 848 KB Output is correct
111 Correct 1 ms 348 KB Output is correct