oj.uz

Submission #524740

# Submission time Handle Problem Language Result Execution time Memory
524740 2022-02-09T23:05:19 Z perchuts Cave (IOI13_cave) C++17
100 / 100
 765 ms 540 KB 
#include <bits/stdc++.h>
#include "cave.h"
#define maxn (int)(1e5+51)
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define ll long long
#define pb push_back
#define ull unsigned long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define inf 2000000001
#define mod 1000000007 //998244353
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }
int door[5001],ans[5001],tmp[5001];
int N;

int isHere(int x,int target,int type){
    int cnt = 0,last = -1;
    for(int i=0;i<N;i++){
        tmp[i] = ans[i];
        if(door[i]==-1){
            if(cnt<x)tmp[i] = 1;
            if(!type&&cnt<x)last = i;
            else if(x==cnt&&type) last = i;
            cnt++;
        }
    }
    if(tryCombination(tmp)==target)return last;
    return -1;
}

void exploreCave(int n){
    N = n;
    for(int i=0;i<n;i++)door[i]=-1;

    int st = tryCombination(tmp); 
    if(st==-1){
        for(int i=0;i<n;i++){
            ans[i] = 1;
            door[i] = tryCombination(ans);
            ans[i] = 0;
        }
        answer(ans,door);
        return;
    }

    for(int i=0;i<n;i++){
        tmp[i] = 1;
        int cur = tryCombination(tmp);
        if(cur<st&&cur!=-1)door[i] = cur;
        else if(cur>st||cur==-1)door[i] = st,ans[i] = 1;
        tmp[i] = 0;
    }
    int target = st + 1;

    while(target<n){
        bool type = isHere(n-target,target,0)==-1;
        int l = 0, r = n - target,resp;
        while(l<=r){
            int md = l + (r-l+1)/2;
            int cur = isHere(md,target,type);
            if(type){
                if(cur==-1)r = md - 1;
                else l = md + 1, resp = cur;
            }else{
                if(cur==-1)l = md + 1;
                else r = md - 1, resp = cur;
            }
        }
        
        ans[resp] = type, door[resp] = target++;
    }

    answer(ans,door);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:77:38: warning: 'resp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         ans[resp] = type, door[resp] = target++;
      |                           ~~~~~~~~~~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 392 KB Output is correct
2 Correct 254 ms 436 KB Output is correct
3 Correct 414 ms 408 KB Output is correct
4 Correct 275 ms 412 KB Output is correct
5 Correct 8 ms 308 KB Output is correct
6 Correct 398 ms 428 KB Output is correct
7 Correct 8 ms 312 KB Output is correct
8 Correct 0 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 0 ms 204 KB Output is correct
12 Correct 401 ms 428 KB Output is correct
13 Correct 390 ms 424 KB Output is correct
14 Correct 399 ms 424 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 8 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 8 ms 392 KB Output is correct
7 Correct 8 ms 388 KB Output is correct
8 Correct 9 ms 332 KB Output is correct
9 Correct 10 ms 332 KB Output is correct
10 Correct 9 ms 332 KB Output is correct
11 Correct 9 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 0 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 296 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 300 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 0 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 296 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 300 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 0 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 49 ms 368 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 99 ms 368 KB Output is correct
24 Correct 90 ms 356 KB Output is correct
25 Correct 89 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 55 ms 352 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 58 ms 316 KB Output is correct
31 Correct 49 ms 312 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 90 ms 332 KB Output is correct
36 Correct 90 ms 356 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 252 ms 392 KB Output is correct
2 Correct 254 ms 436 KB Output is correct
3 Correct 414 ms 408 KB Output is correct
4 Correct 275 ms 412 KB Output is correct
5 Correct 8 ms 308 KB Output is correct
6 Correct 398 ms 428 KB Output is correct
7 Correct 8 ms 312 KB Output is correct
8 Correct 0 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 0 ms 204 KB Output is correct
12 Correct 401 ms 428 KB Output is correct
13 Correct 390 ms 424 KB Output is correct
14 Correct 399 ms 424 KB Output is correct
15 Correct 8 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 8 ms 332 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 8 ms 392 KB Output is correct
21 Correct 8 ms 388 KB Output is correct
22 Correct 9 ms 332 KB Output is correct
23 Correct 10 ms 332 KB Output is correct
24 Correct 9 ms 332 KB Output is correct
25 Correct 9 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 0 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 296 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 300 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 0 ms 332 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 49 ms 368 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 99 ms 368 KB Output is correct
49 Correct 90 ms 356 KB Output is correct
50 Correct 89 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 55 ms 352 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 58 ms 316 KB Output is correct
56 Correct 49 ms 312 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 1 ms 300 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 90 ms 332 KB Output is correct
61 Correct 90 ms 356 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 255 ms 404 KB Output is correct
64 Correct 257 ms 416 KB Output is correct
65 Correct 484 ms 424 KB Output is correct
66 Correct 272 ms 416 KB Output is correct
67 Correct 8 ms 308 KB Output is correct
68 Correct 387 ms 420 KB Output is correct
69 Correct 9 ms 340 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 389 ms 428 KB Output is correct
73 Correct 398 ms 424 KB Output is correct
74 Correct 388 ms 424 KB Output is correct
75 Correct 8 ms 332 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 1 ms 296 KB Output is correct
78 Correct 8 ms 432 KB Output is correct
79 Correct 10 ms 312 KB Output is correct
80 Correct 9 ms 332 KB Output is correct
81 Correct 9 ms 320 KB Output is correct
82 Correct 11 ms 428 KB Output is correct
83 Correct 9 ms 332 KB Output is correct
84 Correct 1 ms 296 KB Output is correct
85 Correct 49 ms 332 KB Output is correct
86 Correct 331 ms 424 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 92 ms 332 KB Output is correct
90 Correct 98 ms 352 KB Output is correct
91 Correct 90 ms 356 KB Output is correct
92 Correct 743 ms 332 KB Output is correct
93 Correct 765 ms 424 KB Output is correct
94 Correct 738 ms 440 KB Output is correct
95 Correct 1 ms 332 KB Output is correct
96 Correct 1 ms 300 KB Output is correct
97 Correct 347 ms 304 KB Output is correct
98 Correct 54 ms 348 KB Output is correct
99 Correct 385 ms 540 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 49 ms 352 KB Output is correct
102 Correct 48 ms 360 KB Output is correct
103 Correct 332 ms 404 KB Output is correct
104 Correct 1 ms 332 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 332 KB Output is correct
107 Correct 91 ms 332 KB Output is correct
108 Correct 90 ms 356 KB Output is correct
109 Correct 744 ms 436 KB Output is correct
110 Correct 750 ms 420 KB Output is correct
111 Correct 0 ms 204 KB Output is correct