oj.uz

Submission #440615

# Submission time Handle Problem Language Result Execution time Memory
440615 2021-07-02T14:17:35 Z julian33 Cave (IOI13_cave) C++14
100 / 100
 519 ms 536 KB 
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

bool done[5005];

// const int MAXN = 5001;
// int doorsOpened[MAXN];
// int placement[MAXN];
// int state[MAXN];
// int N;
// int numTries = 0;
 
// void answer(int S[], int D[]) {
    // for(int i=0;i<N;i++){
        // cout<<D[i]<<" ";
    // }
    // cout<<"\n";
    // for(int i=0;i<N;i++){
        // cout<<S[i]<<" ";
    // }
    // cout<<"\n";
    // for (int a = 0; a < N; a++) {
        // if (S[a] != state[a] || D[a] != placement[a]) {
            // printf("INCORRECT TRY USING %i TRIES\n", numTries);
            // exit(0);
        // }
    // }
    // printf("ANSWER CORRECT USING %i TRIES\n", numTries);
    // exit(0);
// }
 
 
// int tryCombination(int S[]) {
    // std::fill(doorsOpened, doorsOpened + MAXN, 0);
//  
    // for (int a = 0; a < N; a++) {
        // //printf("%i ", S[a]);
        // doorsOpened[placement[a]] = (S[a] == state[a]);
    // }
    // //printf("\n");
    // for (int a = 0; a < N; a++) {
        // //printf("%i ", doorsOpened[a]);
    // }
    // //printf("\n");
//  
    // numTries++;
    // for (int a = 0; a < N; a++) {
        // if (!doorsOpened[a]) {
            // //printf("ret @ %i\n", a);
            // return a;
        // }
    // }
    // //printf("ret >%i\n", N);
    // return -1;
// }

void exploreCave(int N){
    int arr[N];
    int pos[N];
    int n=N;
    for(int i=0;i<N;i++){
        
        int l=0,r=n-1;
        
        for(int j=0;j<n;j++){
            if(!done[j]) arr[j]=0;
        }
        bool up=0;
        int first=tryCombination(arr);
        if(first>i || first==-1) up=true;
        
        for(int j=0;j<n;j++){
            if(!done[j]) arr[j]=!up;
        }
        
        // cout<<up<<"\n";
        
        int ans=-1;
        
        while(l<=r){
            int mid=(l+r)>>1;
            for(int j=l;j<=mid;j++){
                if(!done[j]) arr[j]=up;
            }
            int tmpl=l;
            // for(int j=0;j<N;j++) cout<<arr[j]<<" ";
            // cout<<"\n";
            // cout<<l<<"->"<<mid<<" "<<tryCombination(arr)<<"\n";
            if(tryCombination(arr)==i) r=mid-1,ans=mid;
            else l=mid+1;
            for(int j=tmpl;j<=mid;j++){
                if(!done[j]) arr[j]=!up;
            }
        }
        done[ans]=true;
        arr[ans]=!up;
        pos[ans]=i;
        // cout<<ans<<"\n\n";
    }
    answer(arr,pos);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 388 KB Output is correct
2 Correct 141 ms 332 KB Output is correct
3 Correct 268 ms 404 KB Output is correct
4 Correct 176 ms 452 KB Output is correct
5 Correct 271 ms 400 KB Output is correct
6 Correct 215 ms 404 KB Output is correct
7 Correct 281 ms 400 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 216 ms 332 KB Output is correct
13 Correct 208 ms 400 KB Output is correct
14 Correct 230 ms 400 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 536 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 272 ms 400 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 276 ms 400 KB Output is correct
7 Correct 217 ms 400 KB Output is correct
8 Correct 484 ms 400 KB Output is correct
9 Correct 519 ms 404 KB Output is correct
10 Correct 489 ms 400 KB Output is correct
11 Correct 212 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 31 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 60 ms 332 KB Output is correct
24 Correct 59 ms 452 KB Output is correct
25 Correct 59 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 33 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 32 ms 332 KB Output is correct
31 Correct 31 ms 356 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 58 ms 332 KB Output is correct
36 Correct 58 ms 352 KB Output is correct
37 Correct 0 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 388 KB Output is correct
2 Correct 141 ms 332 KB Output is correct
3 Correct 268 ms 404 KB Output is correct
4 Correct 176 ms 452 KB Output is correct
5 Correct 271 ms 400 KB Output is correct
6 Correct 215 ms 404 KB Output is correct
7 Correct 281 ms 400 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 216 ms 332 KB Output is correct
13 Correct 208 ms 400 KB Output is correct
14 Correct 230 ms 400 KB Output is correct
15 Correct 281 ms 536 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 272 ms 400 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 276 ms 400 KB Output is correct
21 Correct 217 ms 400 KB Output is correct
22 Correct 484 ms 400 KB Output is correct
23 Correct 519 ms 404 KB Output is correct
24 Correct 489 ms 400 KB Output is correct
25 Correct 212 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 31 ms 332 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 60 ms 332 KB Output is correct
49 Correct 59 ms 452 KB Output is correct
50 Correct 59 ms 332 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 33 ms 332 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 32 ms 332 KB Output is correct
56 Correct 31 ms 356 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 58 ms 332 KB Output is correct
61 Correct 58 ms 352 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 142 ms 388 KB Output is correct
64 Correct 158 ms 404 KB Output is correct
65 Correct 270 ms 420 KB Output is correct
66 Correct 175 ms 332 KB Output is correct
67 Correct 279 ms 452 KB Output is correct
68 Correct 227 ms 404 KB Output is correct
69 Correct 270 ms 404 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 216 ms 400 KB Output is correct
73 Correct 223 ms 400 KB Output is correct
74 Correct 211 ms 332 KB Output is correct
75 Correct 263 ms 404 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 279 ms 400 KB Output is correct
79 Correct 227 ms 400 KB Output is correct
80 Correct 485 ms 420 KB Output is correct
81 Correct 469 ms 332 KB Output is correct
82 Correct 477 ms 404 KB Output is correct
83 Correct 218 ms 404 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 32 ms 332 KB Output is correct
86 Correct 224 ms 400 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 300 KB Output is correct
89 Correct 59 ms 332 KB Output is correct
90 Correct 58 ms 332 KB Output is correct
91 Correct 60 ms 332 KB Output is correct
92 Correct 466 ms 408 KB Output is correct
93 Correct 453 ms 404 KB Output is correct
94 Correct 450 ms 400 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 244 ms 332 KB Output is correct
98 Correct 35 ms 332 KB Output is correct
99 Correct 222 ms 404 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 32 ms 332 KB Output is correct
102 Correct 32 ms 332 KB Output is correct
103 Correct 206 ms 404 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 58 ms 336 KB Output is correct
108 Correct 58 ms 312 KB Output is correct
109 Correct 445 ms 416 KB Output is correct
110 Correct 438 ms 332 KB Output is correct
111 Correct 0 ms 204 KB Output is correct