oj.uz

Submission #472618

# Submission time Handle Problem Language Result Execution time Memory
472618 2021-09-13T20:17:43 Z Carmel_Ab1 Cave (IOI13_cave) C++17
100 / 100
 742 ms 580 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

#include "cave.h"
//#include "grader.c"

vi s,d;
void finish(){
    int n=s.size();
    int S[n],D[n];
    for(int i=0; i<n; i++)
        S[i]=s[i],D[i]=d[i];
    answer(S,D);
}
int ask(vi a){
    int n=a.size();
    int c[n];
    for(int i=0; i<n; i++)
        c[i]=a[i];
    return tryCombination(c);
}

void exploreCave(int n) {
    s.resize(n);
    d.resize(n);

    vector<bool>ok(n);
    for(int i=0; i<n-1; i++){
        int l=0,r=n-1,j=-1,p=0;//j opens door #i

        int q1=ask(s);
        while(l<=r){
            int m=(l+r)/2;
            vi cur(s);
            for(int ll=0; ll<=m; ll++)
                if(!ok[ll])
                    cur[ll]^=1;
            int q2=ask(cur);

            if((q1==-1 && q2==-1) || (q2==-1 && q1>i) || (q1==-1 && q2>i) || (q1!=-1 && q2!=-1 && q1<=i && q2<=i) || (q1>i && q2>i)){
                l=m+1;
                continue;
            }
            r=m-1;
            j=m;
            if(q2>=i+1)
                p=1;
            else if(q1>=i+1)
                p=0;
            else if(q2==-1)
                p=1;
            else if(q1==-1)
                p=0;
        }

        d[j]=i;
        s[j]=p;
        ok[j]=1;
    }

    for(int i=0; i<n; i++)
        if(!ok[i]) {
            d[i] = n - 1;
            s[i]=0;
            if(ask(s)!=-1)
                s[i]=1;
        }
    finish();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 332 KB Output is correct
2 Correct 325 ms 432 KB Output is correct
3 Correct 446 ms 464 KB Output is correct
4 Correct 310 ms 432 KB Output is correct
5 Correct 507 ms 472 KB Output is correct
6 Correct 458 ms 460 KB Output is correct
7 Correct 516 ms 460 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 204 KB Output is correct
12 Correct 444 ms 460 KB Output is correct
13 Correct 455 ms 460 KB Output is correct
14 Correct 443 ms 460 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 424 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 488 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 499 ms 476 KB Output is correct
7 Correct 478 ms 460 KB Output is correct
8 Correct 703 ms 460 KB Output is correct
9 Correct 741 ms 472 KB Output is correct
10 Correct 717 ms 464 KB Output is correct
11 Correct 458 ms 460 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 1 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 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 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 1 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 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 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 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 68 ms 336 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 90 ms 340 KB Output is correct
24 Correct 90 ms 348 KB Output is correct
25 Correct 89 ms 356 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 69 ms 336 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 65 ms 348 KB Output is correct
31 Correct 67 ms 340 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 89 ms 336 KB Output is correct
36 Correct 90 ms 348 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 298 ms 332 KB Output is correct
2 Correct 325 ms 432 KB Output is correct
3 Correct 446 ms 464 KB Output is correct
4 Correct 310 ms 432 KB Output is correct
5 Correct 507 ms 472 KB Output is correct
6 Correct 458 ms 460 KB Output is correct
7 Correct 516 ms 460 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 204 KB Output is correct
12 Correct 444 ms 460 KB Output is correct
13 Correct 455 ms 460 KB Output is correct
14 Correct 443 ms 460 KB Output is correct
15 Correct 506 ms 424 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 488 ms 460 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 499 ms 476 KB Output is correct
21 Correct 478 ms 460 KB Output is correct
22 Correct 703 ms 460 KB Output is correct
23 Correct 741 ms 472 KB Output is correct
24 Correct 717 ms 464 KB Output is correct
25 Correct 458 ms 460 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 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 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 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 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 68 ms 336 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 90 ms 340 KB Output is correct
49 Correct 90 ms 348 KB Output is correct
50 Correct 89 ms 356 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 69 ms 336 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 65 ms 348 KB Output is correct
56 Correct 67 ms 340 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 89 ms 336 KB Output is correct
61 Correct 90 ms 348 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 300 ms 428 KB Output is correct
64 Correct 294 ms 452 KB Output is correct
65 Correct 465 ms 464 KB Output is correct
66 Correct 310 ms 448 KB Output is correct
67 Correct 517 ms 460 KB Output is correct
68 Correct 451 ms 460 KB Output is correct
69 Correct 513 ms 460 KB Output is correct
70 Correct 1 ms 272 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 452 ms 472 KB Output is correct
73 Correct 482 ms 460 KB Output is correct
74 Correct 452 ms 460 KB Output is correct
75 Correct 513 ms 460 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 511 ms 460 KB Output is correct
79 Correct 458 ms 460 KB Output is correct
80 Correct 700 ms 460 KB Output is correct
81 Correct 693 ms 464 KB Output is correct
82 Correct 742 ms 460 KB Output is correct
83 Correct 459 ms 580 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 71 ms 332 KB Output is correct
86 Correct 447 ms 460 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 352 KB Output is correct
90 Correct 89 ms 368 KB Output is correct
91 Correct 94 ms 364 KB Output is correct
92 Correct 701 ms 460 KB Output is correct
93 Correct 692 ms 476 KB Output is correct
94 Correct 724 ms 464 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 292 KB Output is correct
97 Correct 514 ms 460 KB Output is correct
98 Correct 67 ms 356 KB Output is correct
99 Correct 449 ms 460 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 66 ms 364 KB Output is correct
102 Correct 68 ms 352 KB Output is correct
103 Correct 468 ms 472 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 304 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 91 ms 452 KB Output is correct
108 Correct 92 ms 352 KB Output is correct
109 Correct 700 ms 580 KB Output is correct
110 Correct 679 ms 456 KB Output is correct
111 Correct 0 ms 204 KB Output is correct