oj.uz

Submission #562973

# Submission time Handle Problem Language Result Execution time Memory
562973 2022-05-15T23:01:53 Z Deepesson Cave (IOI13_cave) C++17
100 / 100
 396 ms 656 KB 
#include <bits/stdc++.h>
#include "cave.h"

#define MAX 5005
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N);


bool skip[MAX];
bool padrao[MAX];
int relacao[MAX];
int n;
int tentar(int l=-1,int r=-1){
    int combinacao[n];
    for(int i=0;i!=n;++i)combinacao[i]=padrao[i];
    if(l!=-1){
        for(int j=l;j<=r;++j){
            if(skip[j])continue;
            ///Ativar chave
            combinacao[j]=1;
        }
    }
    return tryCombination(combinacao);
}
int lessthan(int la,int ra,int obj){
    if(la==ra){
        return la;
    }
    int m = (la+ra)/2;
    int x = tentar(la,m);
    if(x<=obj&&x!=-1){
        return lessthan(la,m,obj);
    }else return lessthan(m+1,ra,obj);
}
int atleast(int la,int ra,int obj){
    if(la==ra){
        return la;
    }
    int m = (la+ra)/2;
    int x = tentar(la,m);
    if(x>obj||x==-1){
        return atleast(la,m,obj);
    }else return atleast(m+1,ra,obj);
}
void exploreCave(int N) {
    n=N;
    for(int i=0;i!=N;++i){
        int val = tentar();
        int ind=-1;
        int esperado=-1;

        if(val>i||val==-1){///Tentar botar o valor para i-1 (Garantido que 1 eh a chave primaria)
            esperado=0;
            ind = lessthan(0,N-1,i);
        }else {///Tentar botar o valor para pelo menos i (Garantido que 0 eh a chave primaria)
            esperado=1;
            ind = atleast(0,N-1,i);
        }


        skip[ind]=true;

        padrao[ind]=esperado;

        relacao[ind]=i;
    }
    int ans1[N],ans2[N];
    for(int i=0;i!=N;++i){
        ans1[i]=padrao[i];
        ans2[i]=relacao[i];
    }
    answer(ans1,ans2);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 432 KB Output is correct
2 Correct 181 ms 404 KB Output is correct
3 Correct 287 ms 540 KB Output is correct
4 Correct 228 ms 472 KB Output is correct
5 Correct 327 ms 412 KB Output is correct
6 Correct 300 ms 408 KB Output is correct
7 Correct 328 ms 416 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 0 ms 300 KB Output is correct
12 Correct 299 ms 420 KB Output is correct
13 Correct 274 ms 416 KB Output is correct
14 Correct 276 ms 400 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 468 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 309 ms 540 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 346 ms 528 KB Output is correct
7 Correct 294 ms 412 KB Output is correct
8 Correct 389 ms 412 KB Output is correct
9 Correct 336 ms 460 KB Output is correct
10 Correct 390 ms 416 KB Output is correct
11 Correct 293 ms 464 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 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 300 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 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 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 300 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 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 41 ms 348 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 52 ms 352 KB Output is correct
24 Correct 46 ms 368 KB Output is correct
25 Correct 46 ms 348 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 45 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 45 ms 364 KB Output is correct
31 Correct 48 ms 364 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 47 ms 340 KB Output is correct
36 Correct 45 ms 364 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 214 ms 432 KB Output is correct
2 Correct 181 ms 404 KB Output is correct
3 Correct 287 ms 540 KB Output is correct
4 Correct 228 ms 472 KB Output is correct
5 Correct 327 ms 412 KB Output is correct
6 Correct 300 ms 408 KB Output is correct
7 Correct 328 ms 416 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 0 ms 300 KB Output is correct
12 Correct 299 ms 420 KB Output is correct
13 Correct 274 ms 416 KB Output is correct
14 Correct 276 ms 400 KB Output is correct
15 Correct 329 ms 468 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 309 ms 540 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 346 ms 528 KB Output is correct
21 Correct 294 ms 412 KB Output is correct
22 Correct 389 ms 412 KB Output is correct
23 Correct 336 ms 460 KB Output is correct
24 Correct 390 ms 416 KB Output is correct
25 Correct 293 ms 464 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 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 300 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 212 KB Output is correct
42 Correct 1 ms 308 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 41 ms 348 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 52 ms 352 KB Output is correct
49 Correct 46 ms 368 KB Output is correct
50 Correct 46 ms 348 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 45 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 45 ms 364 KB Output is correct
56 Correct 48 ms 364 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 47 ms 340 KB Output is correct
61 Correct 45 ms 364 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 212 ms 404 KB Output is correct
64 Correct 184 ms 408 KB Output is correct
65 Correct 296 ms 416 KB Output is correct
66 Correct 241 ms 408 KB Output is correct
67 Correct 325 ms 656 KB Output is correct
68 Correct 301 ms 536 KB Output is correct
69 Correct 331 ms 416 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 304 KB Output is correct
72 Correct 290 ms 400 KB Output is correct
73 Correct 283 ms 460 KB Output is correct
74 Correct 330 ms 412 KB Output is correct
75 Correct 332 ms 468 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 340 ms 412 KB Output is correct
79 Correct 297 ms 412 KB Output is correct
80 Correct 396 ms 416 KB Output is correct
81 Correct 336 ms 412 KB Output is correct
82 Correct 361 ms 412 KB Output is correct
83 Correct 290 ms 536 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 42 ms 356 KB Output is correct
86 Correct 302 ms 412 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 46 ms 348 KB Output is correct
90 Correct 46 ms 360 KB Output is correct
91 Correct 59 ms 352 KB Output is correct
92 Correct 368 ms 424 KB Output is correct
93 Correct 334 ms 416 KB Output is correct
94 Correct 335 ms 412 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 307 ms 460 KB Output is correct
98 Correct 41 ms 364 KB Output is correct
99 Correct 277 ms 420 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 40 ms 352 KB Output is correct
102 Correct 43 ms 340 KB Output is correct
103 Correct 317 ms 420 KB Output is correct
104 Correct 1 ms 308 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 48 ms 340 KB Output is correct
108 Correct 47 ms 356 KB Output is correct
109 Correct 334 ms 416 KB Output is correct
110 Correct 343 ms 460 KB Output is correct
111 Correct 1 ms 212 KB Output is correct