oj.uz

Submission #687366

# Submission time Handle Problem Language Result Execution time Memory
687366 2023-01-26T11:00:18 Z Bliznetc Cave (IOI13_cave) C++17
100 / 100
 300 ms 472 KB 
#include "cave.h"
#include <bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>

using namespace std;

#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
#define F first
#define S second

#define MAX_N 5000
#define MAX_CALLS 70000

typedef pair < int, int > pii;
typedef vector < int >  vi;
typedef vector < vi >  vvi;

/*int N;
static int realS[MAX_N];
static int realD[MAX_N];
static int inv[MAX_N];
static int num_calls;
 
void answer(int S[], int D[]) {
    int i;
    int correct = 1;
    for (i = 0; i < N; ++i)
        if (S[i] != realS[i] || D[i] != realD[i]) {
            correct = 0;
            break;
        }
 
    if (correct)
        printf("CORRECT\n");
    else
        printf("INCORRECT\n");
 
    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", S[i]);
    }
    printf("\n");
 
    for (i = 0; i < N; ++i) {
        if (i > 0)
            printf(" ");
        printf("%d", D[i]);
    }
    printf("\n");
 
    exit(0);
}
 
int tryCombination(int S[]) {
    int i;
 
//    for (i = 0; i < N; i++) {
//        cout << S[i] << " ";
//    }
//    cout << "\n";
    if (num_calls >= MAX_CALLS) {
        printf("INCORRECT\nToo many calls to tryCombination().\n");
        exit(0);
    }
    ++num_calls;
 
    for (i = 0; i < N; ++i)
        if (S[inv[i]] != realS[inv[i]])
            return i;
    return -1;
}
 
int init() {
    int i, res;
 
    FILE *f = fopen("cave.in", "r");
    if (!f)
        fail("Failed to open input file.");
 
    res = fscanf(f, "%d", &N);
 
    for (i = 0; i < N; ++i) {
        res = fscanf(f, "%d", &realS[i]);
    }
    for (i = 0; i < N; ++i) {
        res = fscanf(f, "%d", &realD[i]);
        inv[realD[i]] = i;
    }
 
    num_calls = 0;
    return N;
}*/


void exploreCave (int n) {
    int ask[n];
    int good[n];
    int d[n];
    for (int i = 0; i < n; i++) {
        good[i] = d[i] = -1;
    }
//    vector<int> good(n, -1), d(n, -1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (good[j] == -1) {
                ask[j] = 0;
            }
            else {
                ask[j] = good[j];
            }
        }

        int x = tryCombination(ask);
        if (x == i) {
            for (int j = 0; j < n; j++) {
                if (good[j] == -1) {
                    ask[j] = 1;
                }
                else {
                    ask[j] = good[j];
                }
            }
        }

        int l = 0, r = n - 1;
        while (r - l > 0) {
            int mid = (l + r) / 2;
            for (int j = l; j <= mid; j++) {
                if (good[j] == -1) {
                    ask[j] = 1 - ask[j];
                }
                else {
                    ask[j] = good[j];
                }
            }

            x = tryCombination(ask);
//            cout << i << " - " << x << " " << l << " " << r << "\n";
            if (x == i) {
                for (int j = l; j <= mid; j++) {
                    if (good[j] == -1) {
                        ask[j] = 1 - ask[j];
                    }
                    else {
                        ask[j] = good[j];
                    }
                }
                for (int j = mid + 1; j <= r; j++) {
                    if (good[j] == -1) {
                        ask[j] = 1 - ask[j];
                    }
                    else {
                        ask[j] = good[j];
                    }
                }
                r = mid;
            }
            else {
                l = mid + 1;
            }
//            cout << l << " " << r << ":\n";
//            for (int j = 0; j < n; j++) {
//                cout << ask[j] << " ";
//            }
//            cout << "\n";
        }


        /*if (good[l] == -1) {
            ask[l] = 1 - ask[l];
        }
        else {
            ask[l] = good[l];
        }
        x = tryCombination(ask);
        if (x == i) {
            if (good[l] == -1) {
                ask[l] = 1 - ask[l];
            }
            else {
                ask[l] = good[l];
            }
            l = r;
        }*/

        good[l] = ask[l];
        d[l] = i;
//        cout << i << " - " <<  l << " " << good[i] << " " << d[l] << "\n";
//        cout << "\n";
    }

    answer(good, d);
}

/*
int main() {
    int N;
    N = init();
    exploreCave(N);
    printf("INCORRECT\nYour solution did not call answer().\n");
    return 0;
}*/

/*
signed main() {
    vi a;
    a.pb(-2);
    a.pb(2);
    a.pb(2);
    a.pb(-2);
    a.pb(-2);
    a.pb(2);
    cout << count_swaps(a);
}
 */

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 388 KB Output is correct
2 Correct 134 ms 380 KB Output is correct
3 Correct 170 ms 388 KB Output is correct
4 Correct 114 ms 408 KB Output is correct
5 Correct 177 ms 424 KB Output is correct
6 Correct 164 ms 340 KB Output is correct
7 Correct 178 ms 428 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 158 ms 436 KB Output is correct
13 Correct 177 ms 428 KB Output is correct
14 Correct 176 ms 424 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 388 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 170 ms 448 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 175 ms 360 KB Output is correct
7 Correct 157 ms 460 KB Output is correct
8 Correct 274 ms 444 KB Output is correct
9 Correct 282 ms 428 KB Output is correct
10 Correct 290 ms 340 KB Output is correct
11 Correct 161 ms 428 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 224 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 31 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 43 ms 288 KB Output is correct
24 Correct 40 ms 340 KB Output is correct
25 Correct 43 ms 340 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 29 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 26 ms 340 KB Output is correct
31 Correct 24 ms 348 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 39 ms 340 KB Output is correct
36 Correct 38 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 388 KB Output is correct
2 Correct 134 ms 380 KB Output is correct
3 Correct 170 ms 388 KB Output is correct
4 Correct 114 ms 408 KB Output is correct
5 Correct 177 ms 424 KB Output is correct
6 Correct 164 ms 340 KB Output is correct
7 Correct 178 ms 428 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 158 ms 436 KB Output is correct
13 Correct 177 ms 428 KB Output is correct
14 Correct 176 ms 424 KB Output is correct
15 Correct 169 ms 388 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 170 ms 448 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 175 ms 360 KB Output is correct
21 Correct 157 ms 460 KB Output is correct
22 Correct 274 ms 444 KB Output is correct
23 Correct 282 ms 428 KB Output is correct
24 Correct 290 ms 340 KB Output is correct
25 Correct 161 ms 428 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 224 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 5 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 31 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 43 ms 288 KB Output is correct
49 Correct 40 ms 340 KB Output is correct
50 Correct 43 ms 340 KB Output is correct
51 Correct 2 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 29 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 26 ms 340 KB Output is correct
56 Correct 24 ms 348 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 39 ms 340 KB Output is correct
61 Correct 38 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 105 ms 408 KB Output is correct
64 Correct 136 ms 408 KB Output is correct
65 Correct 184 ms 436 KB Output is correct
66 Correct 116 ms 408 KB Output is correct
67 Correct 164 ms 424 KB Output is correct
68 Correct 169 ms 472 KB Output is correct
69 Correct 189 ms 340 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 168 ms 428 KB Output is correct
73 Correct 161 ms 444 KB Output is correct
74 Correct 190 ms 428 KB Output is correct
75 Correct 183 ms 340 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 156 ms 440 KB Output is correct
79 Correct 168 ms 440 KB Output is correct
80 Correct 265 ms 340 KB Output is correct
81 Correct 295 ms 428 KB Output is correct
82 Correct 282 ms 420 KB Output is correct
83 Correct 158 ms 428 KB Output is correct
84 Correct 1 ms 304 KB Output is correct
85 Correct 26 ms 372 KB Output is correct
86 Correct 176 ms 440 KB Output is correct
87 Correct 1 ms 300 KB Output is correct
88 Correct 1 ms 308 KB Output is correct
89 Correct 42 ms 344 KB Output is correct
90 Correct 41 ms 316 KB Output is correct
91 Correct 41 ms 312 KB Output is correct
92 Correct 282 ms 424 KB Output is correct
93 Correct 285 ms 340 KB Output is correct
94 Correct 300 ms 428 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 162 ms 340 KB Output is correct
98 Correct 25 ms 340 KB Output is correct
99 Correct 154 ms 340 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 25 ms 312 KB Output is correct
102 Correct 27 ms 340 KB Output is correct
103 Correct 168 ms 424 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 47 ms 340 KB Output is correct
108 Correct 47 ms 460 KB Output is correct
109 Correct 268 ms 440 KB Output is correct
110 Correct 265 ms 340 KB Output is correct
111 Correct 1 ms 212 KB Output is correct