oj.uz

Submission #668470

# Submission time Handle Problem Language Result Execution time Memory
668470 2022-12-04T00:00:12 Z allin27x Cave (IOI13_cave) C++14
100 / 100
 1358 ms 968 KB 
#include <iostream>
#include <vector>
#include <unordered_set>
#include <deque>
#include "cave.h"
using namespace std;

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

void exploreCave(int N){
    int doors[N]={};
    int perm[N] = {};

    unordered_set<int> f;
    int tr[N] = {};
    for (int s=0; s<N; s++){
        int pos = 0;
        for (int i=0; i<N; i++){
            if (f.count(i)) tr[i] = perm[i]; else tr[i]=0;
        }
        int r = tryCombination(tr);
        if (r==s) pos = 1;
        if (!pos) for (int i=0; i<N; i++){
            if (f.count(i)) tr[i] = perm[i]; else tr[i]=1;
        }
        deque<int> av={};
        for (int i=0; i<N; i++) if (!f.count(i)) av.push_back(i);
        int a = 0, b = (int)av.size()-1;
        while (a!=b){
            int m = (a+b)/2;
            int q = a;
            for (auto it = av.begin(); q<=m; it++){
                if (!f.count(*it)) tr[*it] = pos;
                q++;
            }
            r = tryCombination(tr);
            if (r==s) {
                int q = a;
                for (auto it = av.begin(); q<=m; it++){
                    if (!f.count(*it)) tr[*it] =! pos;
                    q++;
                }
                for (int i=a; i<=m; i++) av.pop_front();
                a = m+1;
            }else {
                int q = a;
                for (auto it = av.begin(); q<=m; it++){
                    if (!f.count(*it)) tr[*it] = !pos;
                    q++;
                }
                for (int i=b; i>m; i--) av.pop_back();
                b =m;
            }

        }
        doors[av.front()] = s;
        perm[av.front()] = pos;
        f.insert(av.front());
        tr[av.front()] = pos;
    }
    answer(perm,doors);

}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 652 ms 600 KB Output is correct
2 Correct 510 ms 740 KB Output is correct
3 Correct 781 ms 712 KB Output is correct
4 Correct 533 ms 580 KB Output is correct
5 Correct 981 ms 588 KB Output is correct
6 Correct 861 ms 584 KB Output is correct
7 Correct 987 ms 760 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 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 840 ms 680 KB Output is correct
13 Correct 870 ms 704 KB Output is correct
14 Correct 846 ms 552 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 961 ms 668 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 930 ms 616 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 963 ms 680 KB Output is correct
7 Correct 926 ms 636 KB Output is correct
8 Correct 1358 ms 736 KB Output is correct
9 Correct 1345 ms 772 KB Output is correct
10 Correct 1324 ms 728 KB Output is correct
11 Correct 917 ms 640 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 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 0 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 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 120 ms 364 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 175 ms 360 KB Output is correct
24 Correct 189 ms 492 KB Output is correct
25 Correct 173 ms 364 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 129 ms 404 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 131 ms 364 KB Output is correct
31 Correct 127 ms 408 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 188 ms 376 KB Output is correct
36 Correct 194 ms 484 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 652 ms 600 KB Output is correct
2 Correct 510 ms 740 KB Output is correct
3 Correct 781 ms 712 KB Output is correct
4 Correct 533 ms 580 KB Output is correct
5 Correct 981 ms 588 KB Output is correct
6 Correct 861 ms 584 KB Output is correct
7 Correct 987 ms 760 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 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 840 ms 680 KB Output is correct
13 Correct 870 ms 704 KB Output is correct
14 Correct 846 ms 552 KB Output is correct
15 Correct 961 ms 668 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 930 ms 616 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 963 ms 680 KB Output is correct
21 Correct 926 ms 636 KB Output is correct
22 Correct 1358 ms 736 KB Output is correct
23 Correct 1345 ms 772 KB Output is correct
24 Correct 1324 ms 728 KB Output is correct
25 Correct 917 ms 640 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 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 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 120 ms 364 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 175 ms 360 KB Output is correct
49 Correct 189 ms 492 KB Output is correct
50 Correct 173 ms 364 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 129 ms 404 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 131 ms 364 KB Output is correct
56 Correct 127 ms 408 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 304 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 188 ms 376 KB Output is correct
61 Correct 194 ms 484 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 621 ms 728 KB Output is correct
64 Correct 493 ms 564 KB Output is correct
65 Correct 742 ms 532 KB Output is correct
66 Correct 501 ms 592 KB Output is correct
67 Correct 947 ms 716 KB Output is correct
68 Correct 812 ms 820 KB Output is correct
69 Correct 936 ms 628 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 296 KB Output is correct
72 Correct 821 ms 632 KB Output is correct
73 Correct 803 ms 660 KB Output is correct
74 Correct 844 ms 624 KB Output is correct
75 Correct 897 ms 856 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 917 ms 828 KB Output is correct
79 Correct 895 ms 704 KB Output is correct
80 Correct 1329 ms 724 KB Output is correct
81 Correct 1331 ms 704 KB Output is correct
82 Correct 1322 ms 624 KB Output is correct
83 Correct 912 ms 724 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 116 ms 444 KB Output is correct
86 Correct 703 ms 716 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 175 ms 400 KB Output is correct
90 Correct 179 ms 436 KB Output is correct
91 Correct 174 ms 380 KB Output is correct
92 Correct 1136 ms 632 KB Output is correct
93 Correct 1142 ms 652 KB Output is correct
94 Correct 1141 ms 852 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 783 ms 588 KB Output is correct
98 Correct 128 ms 376 KB Output is correct
99 Correct 786 ms 968 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 128 ms 340 KB Output is correct
102 Correct 127 ms 380 KB Output is correct
103 Correct 783 ms 748 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 312 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 172 ms 504 KB Output is correct
108 Correct 191 ms 416 KB Output is correct
109 Correct 1136 ms 608 KB Output is correct
110 Correct 1268 ms 636 KB Output is correct
111 Correct 0 ms 212 KB Output is correct