oj.uz

Submission #547540

# Submission time Handle Problem Language Result Execution time Memory
547540 2022-04-10T22:34:33 Z beaconmc Cave (IOI13_cave) C++14
100 / 100
 1109 ms 1076 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#include "cave.h"


typedef long long ll;
using namespace std;
using namespace __gnu_pbds;

#define FOR(i, x, y) for(int i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll int



vector<vector<ll>> found;

ll test(int N, int n){
    ll ans[N];
    FOR(i,0,N){
        ans[i] = 0;
    }
    for (auto&i : found){
        ans[i[1]] = i[2];
    }
    ll result = tryCombination(ans);
    if (result>n || result==-1){
        return 0;
    }else{
        return 1;
    }

}

ll test2(int n, int k, int s, int l){
    k++;
    ll ans[n];
    FOR(i,0,n){
        ans[i] = 0;
    }
    FOR(i,0,k) ans[i] = s;
    FOR(i,k,n){
        if (s==0) ans[i] = 1;
        else ans[i] = 0;
    } 
    for (auto&i : found){
        ans[i[1]] = i[2];
    }
    ll result = tryCombination(ans);
    if (result>l || result==-1){
        return 1;
    }else{
        return 0;
    }

}

void exploreCave(int N){
    FOR(i,0,N){
        ll switchd = test(N,i);
        ll lo = 0;
        ll hi = N;
        ll mid = 0;
        while (lo < hi) {
            mid = lo + (hi - lo) / 2;
            if (test2(N, mid, switchd, i)) {
                hi = mid;
            } else {
                lo = mid + 1;
            }
        };
        found.push_back({i, lo, switchd});
    }
    ll S[N];
    ll D[N];

    for (auto&i : found){
        S[i[1]] = i[2];
        D[i[1]] = i[0];
    }
    answer(S,D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 572 KB Output is correct
2 Correct 647 ms 696 KB Output is correct
3 Correct 1050 ms 808 KB Output is correct
4 Correct 688 ms 668 KB Output is correct
5 Correct 915 ms 816 KB Output is correct
6 Correct 1062 ms 808 KB Output is correct
7 Correct 1063 ms 736 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 304 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1018 ms 756 KB Output is correct
13 Correct 1034 ms 684 KB Output is correct
14 Correct 992 ms 712 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1044 ms 824 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1025 ms 816 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1079 ms 864 KB Output is correct
7 Correct 1109 ms 700 KB Output is correct
8 Correct 1069 ms 740 KB Output is correct
9 Correct 1061 ms 740 KB Output is correct
10 Correct 977 ms 724 KB Output is correct
11 Correct 1058 ms 700 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 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 304 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 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 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 304 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 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 135 ms 396 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 144 ms 444 KB Output is correct
24 Correct 143 ms 508 KB Output is correct
25 Correct 150 ms 440 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 155 ms 420 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 140 ms 384 KB Output is correct
31 Correct 132 ms 416 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 304 KB Output is correct
35 Correct 141 ms 396 KB Output is correct
36 Correct 150 ms 436 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 693 ms 572 KB Output is correct
2 Correct 647 ms 696 KB Output is correct
3 Correct 1050 ms 808 KB Output is correct
4 Correct 688 ms 668 KB Output is correct
5 Correct 915 ms 816 KB Output is correct
6 Correct 1062 ms 808 KB Output is correct
7 Correct 1063 ms 736 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 304 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1018 ms 756 KB Output is correct
13 Correct 1034 ms 684 KB Output is correct
14 Correct 992 ms 712 KB Output is correct
15 Correct 1044 ms 824 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1025 ms 816 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1079 ms 864 KB Output is correct
21 Correct 1109 ms 700 KB Output is correct
22 Correct 1069 ms 740 KB Output is correct
23 Correct 1061 ms 740 KB Output is correct
24 Correct 977 ms 724 KB Output is correct
25 Correct 1058 ms 700 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 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 304 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 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 300 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 304 KB Output is correct
44 Correct 1 ms 304 KB Output is correct
45 Correct 135 ms 396 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 144 ms 444 KB Output is correct
49 Correct 143 ms 508 KB Output is correct
50 Correct 150 ms 440 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 155 ms 420 KB Output is correct
54 Correct 1 ms 304 KB Output is correct
55 Correct 140 ms 384 KB Output is correct
56 Correct 132 ms 416 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 304 KB Output is correct
60 Correct 141 ms 396 KB Output is correct
61 Correct 150 ms 436 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 634 ms 592 KB Output is correct
64 Correct 621 ms 612 KB Output is correct
65 Correct 956 ms 720 KB Output is correct
66 Correct 648 ms 712 KB Output is correct
67 Correct 967 ms 972 KB Output is correct
68 Correct 951 ms 844 KB Output is correct
69 Correct 951 ms 820 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 943 ms 812 KB Output is correct
73 Correct 955 ms 832 KB Output is correct
74 Correct 997 ms 856 KB Output is correct
75 Correct 974 ms 836 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 0 ms 304 KB Output is correct
78 Correct 969 ms 800 KB Output is correct
79 Correct 998 ms 860 KB Output is correct
80 Correct 983 ms 844 KB Output is correct
81 Correct 990 ms 952 KB Output is correct
82 Correct 986 ms 952 KB Output is correct
83 Correct 990 ms 860 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 141 ms 436 KB Output is correct
86 Correct 932 ms 928 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 136 ms 376 KB Output is correct
90 Correct 137 ms 632 KB Output is correct
91 Correct 136 ms 376 KB Output is correct
92 Correct 984 ms 832 KB Output is correct
93 Correct 971 ms 852 KB Output is correct
94 Correct 1016 ms 740 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 304 KB Output is correct
97 Correct 950 ms 856 KB Output is correct
98 Correct 141 ms 436 KB Output is correct
99 Correct 941 ms 848 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 134 ms 380 KB Output is correct
102 Correct 142 ms 372 KB Output is correct
103 Correct 926 ms 1076 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 138 ms 388 KB Output is correct
108 Correct 138 ms 420 KB Output is correct
109 Correct 980 ms 1068 KB Output is correct
110 Correct 982 ms 984 KB Output is correct
111 Correct 1 ms 212 KB Output is correct