oj.uz

Submission #581694

# Submission time Handle Problem Language Result Execution time Memory
581694 2022-06-23T04:00:55 Z tranxuanbach Cave (IOI13_cave) C++17
100 / 100
 586 ms 576 KB 
#ifndef FEXT

#include "cave.h"

#endif

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (auto i = l; i < r; i++)
#define ForE(i, l, r) for (auto i = l; i <= r; i++)
#define FordE(i, l, r) for (auto i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pair <int, int>>;
using vvi = vector <vector <int>>;

#ifdef FEXT

void answer(int S[], int D[]);

int tryCombination(int S[]);

#endif

const int N = 5e3 + 5;

int n;

int s[N], d[N];
int t[N];
int a[N];

int realtryCombination(int S[]){
    int ans = tryCombination(S);
    if (ans == -1){
        ans = n;
    }
    return ans;
}

void find_pos(int pos){
    if (pos == n){
        return;
    }

    int m = 0;
    For(i, 0, n){
        if (d[i] == -1){
            a[m++] = i;
            t[i] = 0;
        }
    }

    int val = (realtryCombination(t) > pos ? 0 : 1);

    int lo = 0, hi = m - 1;
    while (lo < hi){
        int mid = (lo + hi) >> 1;

        For(i, 0, m){
            if (i <= mid){
                t[a[i]] = 1;
            }
            else{
                t[a[i]] = 0;
            }
        }

        int tval = (realtryCombination(t) > pos ? 0 : 1);
        if (val != tval){
            hi = mid;
        }
        else{
            lo = mid + 1;
        }
    }

    d[a[lo]] = pos;
    s[a[lo]] = val;
    t[a[lo]] = val;

    find_pos(pos + 1);
}

void exploreCave(int _n){
    n = _n;
    For(i, 0, n){
        d[i] = -1;
    }

    find_pos(0);
    answer(s, d);
}

#ifdef FEXT

#define MAX_N 5000
#define MAX_CALLS 70000

#define fail(s, x...) do { \
        fprintf(stderr, s "\n", ## x); \
        exit(1); \
    } while(0)

/* Symbol obfuscation */
#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna

static 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;

    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("KEK.inp", "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;
}

signed main(){
    // ios_base::sync_with_stdio(0);
    // cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    freopen("KEK.out", "w", stdout);
    int N;
    N = init();
    exploreCave(N);
    printf("INCORRECT\nYour solution did not call answer().\n");
    return 0;
}

#endif

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 528 KB Output is correct
2 Correct 245 ms 480 KB Output is correct
3 Correct 453 ms 576 KB Output is correct
4 Correct 340 ms 556 KB Output is correct
5 Correct 487 ms 452 KB Output is correct
6 Correct 519 ms 340 KB Output is correct
7 Correct 497 ms 436 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 509 ms 440 KB Output is correct
13 Correct 499 ms 468 KB Output is correct
14 Correct 446 ms 460 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 450 ms 404 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 538 ms 444 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 497 ms 572 KB Output is correct
7 Correct 395 ms 448 KB Output is correct
8 Correct 489 ms 468 KB Output is correct
9 Correct 530 ms 448 KB Output is correct
10 Correct 566 ms 448 KB Output is correct
11 Correct 495 ms 432 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 0 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 0 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 1 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 60 ms 344 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 58 ms 352 KB Output is correct
24 Correct 61 ms 340 KB Output is correct
25 Correct 78 ms 356 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 74 ms 364 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 72 ms 340 KB Output is correct
31 Correct 75 ms 344 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 75 ms 352 KB Output is correct
36 Correct 74 ms 352 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 528 KB Output is correct
2 Correct 245 ms 480 KB Output is correct
3 Correct 453 ms 576 KB Output is correct
4 Correct 340 ms 556 KB Output is correct
5 Correct 487 ms 452 KB Output is correct
6 Correct 519 ms 340 KB Output is correct
7 Correct 497 ms 436 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 509 ms 440 KB Output is correct
13 Correct 499 ms 468 KB Output is correct
14 Correct 446 ms 460 KB Output is correct
15 Correct 450 ms 404 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 538 ms 444 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 497 ms 572 KB Output is correct
21 Correct 395 ms 448 KB Output is correct
22 Correct 489 ms 468 KB Output is correct
23 Correct 530 ms 448 KB Output is correct
24 Correct 566 ms 448 KB Output is correct
25 Correct 495 ms 432 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 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 0 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 1 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 60 ms 344 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 58 ms 352 KB Output is correct
49 Correct 61 ms 340 KB Output is correct
50 Correct 78 ms 356 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 74 ms 364 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 72 ms 340 KB Output is correct
56 Correct 75 ms 344 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 75 ms 352 KB Output is correct
61 Correct 74 ms 352 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 310 ms 428 KB Output is correct
64 Correct 325 ms 424 KB Output is correct
65 Correct 474 ms 440 KB Output is correct
66 Correct 373 ms 464 KB Output is correct
67 Correct 502 ms 564 KB Output is correct
68 Correct 429 ms 452 KB Output is correct
69 Correct 539 ms 468 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 511 ms 564 KB Output is correct
73 Correct 544 ms 448 KB Output is correct
74 Correct 538 ms 448 KB Output is correct
75 Correct 425 ms 460 KB Output is correct
76 Correct 1 ms 308 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 537 ms 452 KB Output is correct
79 Correct 502 ms 448 KB Output is correct
80 Correct 501 ms 448 KB Output is correct
81 Correct 583 ms 468 KB Output is correct
82 Correct 586 ms 448 KB Output is correct
83 Correct 474 ms 448 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 74 ms 376 KB Output is correct
86 Correct 438 ms 564 KB Output is correct
87 Correct 2 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 76 ms 312 KB Output is correct
90 Correct 79 ms 372 KB Output is correct
91 Correct 58 ms 372 KB Output is correct
92 Correct 405 ms 340 KB Output is correct
93 Correct 554 ms 448 KB Output is correct
94 Correct 512 ms 452 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 475 ms 444 KB Output is correct
98 Correct 72 ms 372 KB Output is correct
99 Correct 476 ms 440 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 71 ms 380 KB Output is correct
102 Correct 43 ms 316 KB Output is correct
103 Correct 499 ms 448 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 81 ms 384 KB Output is correct
108 Correct 59 ms 376 KB Output is correct
109 Correct 551 ms 448 KB Output is correct
110 Correct 496 ms 560 KB Output is correct
111 Correct 1 ms 212 KB Output is correct