oj.uz

Submission #99334

# Submission time Handle Problem Language Result Execution time Memory
99334 2019-03-02T16:41:49 Z karma Cave (IOI13_cave) C++11
100 / 100
 794 ms 640 KB 
#include<bits/stdc++.h>
#include "cave.h"

using namespace std;

const int maxN = 5007;
const int MAX_CALLS = 70000;
int n, s[maxN], d[maxN], vis[maxN];
//int realS[maxN], realD[maxN], inv[maxN];
//int num_calls;
//
//void answer(int S[], int D[]) {
//    int i;
//    bool correct = 1;
//    for (i = 0; i < n; ++i)
//        if (S[i] != realS[i] || D[i] != realD[i]) {
//            correct = 0;
//            break;
//        }
//    if (correct) cout << "CORRECT\n";
//    else {
//        cout << "INCORRECT\n";
//        for(int i = 0; i < n; ++i) {
//            cout << realS[i] << ' ';
//        }
//        cout << '\n';
//        for(int i = 0; i < n; ++i) {
//            cout << realD[i] << ' ';
//        }
//    }
//    exit(0);
//}
//
//int tryCombination(int S[]) {
//    int i;
//
//    if (num_calls >= MAX_CALLS) {
//        cout << "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()
//{
//    srand(time(0));
//    int n = rand() % 10;
//    for(int i = 0; i < n; ++i) realS[i] = rand() % 2, realD[i] = i;
//    random_shuffle(realD, realD + n);
//    for(int i = 0; i < n; ++i) inv[realD[i]] = i;
//    return n;
//}

bool Chk(int mid, int pos)
{
     for(int i = 0; i < n; ++i) {
        if(!vis[i]) {
            if(mid) --mid, s[i] = 1;
            else s[i] = 0;
        }
     }
     int door = tryCombination(s);
     return door == -1 || door > pos;
}

void exploreCave(int sz)
{
     n = sz;
     fill_n(s, n + 1, 0);
     fill_n(vis, n + 1, 0);
     for(int i = 0; i < n; ++i) {
        int cur = tryCombination(s);
        bool open = 0;
        if(cur == -1 || cur > i) open = 1;
        int low = 0, high = n - i;
        while(low <= high) {
            int mid = (low + high) / 2;
            if(Chk(mid, i) != open) high = mid - 1;
            else low = mid + 1;
        }
        for(int j = 0; j < n; ++j) {
           if(!vis[j]) --low, s[j] = 0;
           if(!low) {
              open? s[j] = 0: s[j] = 1;
              d[j] = i, vis[j] = 1; break;
           }
        }
     }
     answer(s, d);
}
//
//int main() {
//    int n;
//	n = init();
//    exploreCave(n);
//    printf("INCORRECT\nYour solution did not call answer().\n");
//    return 0;
//}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 640 KB Output is correct
2 Correct 226 ms 512 KB Output is correct
3 Correct 405 ms 532 KB Output is correct
4 Correct 233 ms 504 KB Output is correct
5 Correct 347 ms 504 KB Output is correct
6 Correct 486 ms 624 KB Output is correct
7 Correct 354 ms 496 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 326 ms 516 KB Output is correct
13 Correct 353 ms 500 KB Output is correct
14 Correct 398 ms 508 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 496 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 373 ms 508 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 6 ms 452 KB Output is correct
6 Correct 393 ms 556 KB Output is correct
7 Correct 362 ms 524 KB Output is correct
8 Correct 794 ms 512 KB Output is correct
9 Correct 682 ms 512 KB Output is correct
10 Correct 716 ms 640 KB Output is correct
11 Correct 398 ms 508 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 452 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 396 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 324 KB Output is correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 5 ms 452 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 452 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 396 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 324 KB Output is correct
13 Correct 8 ms 512 KB Output is correct
14 Correct 5 ms 452 KB Output is correct
15 Correct 6 ms 420 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 56 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 120 ms 512 KB Output is correct
24 Correct 117 ms 460 KB Output is correct
25 Correct 107 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 54 ms 464 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 80 ms 512 KB Output is correct
31 Correct 75 ms 488 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 460 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 109 ms 460 KB Output is correct
36 Correct 97 ms 384 KB Output is correct
37 Correct 6 ms 512 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 640 KB Output is correct
2 Correct 226 ms 512 KB Output is correct
3 Correct 405 ms 532 KB Output is correct
4 Correct 233 ms 504 KB Output is correct
5 Correct 347 ms 504 KB Output is correct
6 Correct 486 ms 624 KB Output is correct
7 Correct 354 ms 496 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 326 ms 516 KB Output is correct
13 Correct 353 ms 500 KB Output is correct
14 Correct 398 ms 508 KB Output is correct
15 Correct 338 ms 496 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 373 ms 508 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 452 KB Output is correct
20 Correct 393 ms 556 KB Output is correct
21 Correct 362 ms 524 KB Output is correct
22 Correct 794 ms 512 KB Output is correct
23 Correct 682 ms 512 KB Output is correct
24 Correct 716 ms 640 KB Output is correct
25 Correct 398 ms 508 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 452 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 396 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 324 KB Output is correct
38 Correct 8 ms 512 KB Output is correct
39 Correct 5 ms 452 KB Output is correct
40 Correct 6 ms 420 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 6 ms 384 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 56 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 120 ms 512 KB Output is correct
49 Correct 117 ms 460 KB Output is correct
50 Correct 107 ms 512 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 54 ms 464 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 80 ms 512 KB Output is correct
56 Correct 75 ms 488 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 6 ms 460 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 109 ms 460 KB Output is correct
61 Correct 97 ms 384 KB Output is correct
62 Correct 6 ms 512 KB Output is correct
63 Correct 281 ms 524 KB Output is correct
64 Correct 196 ms 516 KB Output is correct
65 Correct 345 ms 500 KB Output is correct
66 Correct 198 ms 460 KB Output is correct
67 Correct 284 ms 504 KB Output is correct
68 Correct 305 ms 516 KB Output is correct
69 Correct 314 ms 500 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 316 ms 504 KB Output is correct
73 Correct 314 ms 500 KB Output is correct
74 Correct 383 ms 516 KB Output is correct
75 Correct 374 ms 504 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 430 ms 528 KB Output is correct
79 Correct 372 ms 528 KB Output is correct
80 Correct 727 ms 640 KB Output is correct
81 Correct 733 ms 524 KB Output is correct
82 Correct 707 ms 512 KB Output is correct
83 Correct 408 ms 504 KB Output is correct
84 Correct 6 ms 512 KB Output is correct
85 Correct 97 ms 468 KB Output is correct
86 Correct 433 ms 508 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 94 ms 464 KB Output is correct
90 Correct 90 ms 480 KB Output is correct
91 Correct 98 ms 464 KB Output is correct
92 Correct 712 ms 512 KB Output is correct
93 Correct 677 ms 640 KB Output is correct
94 Correct 718 ms 640 KB Output is correct
95 Correct 5 ms 512 KB Output is correct
96 Correct 5 ms 384 KB Output is correct
97 Correct 414 ms 508 KB Output is correct
98 Correct 60 ms 460 KB Output is correct
99 Correct 335 ms 504 KB Output is correct
100 Correct 6 ms 384 KB Output is correct
101 Correct 60 ms 464 KB Output is correct
102 Correct 86 ms 468 KB Output is correct
103 Correct 397 ms 516 KB Output is correct
104 Correct 6 ms 384 KB Output is correct
105 Correct 6 ms 512 KB Output is correct
106 Correct 6 ms 384 KB Output is correct
107 Correct 112 ms 512 KB Output is correct
108 Correct 102 ms 512 KB Output is correct
109 Correct 694 ms 640 KB Output is correct
110 Correct 707 ms 512 KB Output is correct
111 Correct 5 ms 384 KB Output is correct