oj.uz

Submission #318783

# Submission time Handle Problem Language Result Execution time Memory
318783 2020-11-03T08:16:36 Z Haruto810198 Cave (IOI13_cave) C++17
100 / 100
 973 ms 868 KB 
#include <bits/stdc++.h>

/******/
#include "cave.h"
/******/

using namespace std;

//#define int long long
#define double long double

#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define mii map<int,int>

#define F first
#define S second

#define pb push_back
#define pf push_front
#define eb emplace_back
#define ef emplace_front
#define pob pop_back
#define pof pop_front

const int INF=2147483647;
const int MOD=1000000007;
const int mod=998244353;
const double eps=1e-12;

/******

int tryCombination(int guess[]){

    cout<<"? ";
    for(int i=0;i<4;i++){
        cout<<guess[i]<<" ";
    }
    cout<<endl;

    int ret;
    cin>>ret;
    return ret;
}

void answer(int state[],int pos[]){

    cout<<"!"<<endl;
    for(int i=0;i<4;i++){
        cout<<state[i]<<" ";
    }
    cout<<endl;
    for(int i=0;i<4;i++){
        cout<<pos[i]<<" ";
    }
    cout<<endl;

}

******/

void exploreCave(int n){

    int state[n],pos[n];
    int guess[n];
    int ans;

    int res_state[n],res_pos[n];

    for(int j=0;j<n;j++){
        state[j]=-1;
    }

    for(int i=0;i<n;i++){

        for(int j=0;j<n;j++){
            guess[j]=0;
        }
        for(int j=0;j<i;j++){
            guess[ pos[j] ]=state[j];
        }
        ans=tryCombination(guess);
        if( ans>i or ans==-1 ){
            state[i]=0;
        }
        else{
            state[i]=1;
        }

        int l=0,r=n-1,mid;
        while(l<r){

            mid=(l+r)/2;

            /***debug***
            cout<<l<<" "<<r<<" "<<mid<<endl;
            ***debug***/

            for(int j=0;j<n;j++){
                guess[j]=1-state[i];
            }
            for(int j=l;j<=mid;j++){
                guess[j]=state[i];
            }
            for(int j=0;j<i;j++){
                guess[ pos[j] ]=state[j];
            }

            ans=tryCombination(guess);
            if(ans>i or ans==-1){
                r=mid;
            }
            else{
                l=mid+1;
            }

        }
        pos[i]=l;

        /***debug***
        cout<<"//"<<endl;
        for(int i=0;i<n;i++){
            cout<<state[i]<<" ";
        }
        cout<<endl;
        for(int i=0;i<n;i++){
            cout<<pos[i]<<" ";
        }
        cout<<endl;
        cout<<"//"<<endl;
        ***debug***/

    }

    for(int i=0;i<n;i++){
        res_pos[ pos[i] ] = i;
    }
    for(int i=0;i<n;i++){
        res_state[i] = state[ res_pos[i] ];
    }

    answer( res_state , res_pos );

}

/******

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    exploreCave(n);

    return 0;
}

******/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 484 KB Output is correct
2 Correct 571 ms 484 KB Output is correct
3 Correct 872 ms 740 KB Output is correct
4 Correct 599 ms 596 KB Output is correct
5 Correct 925 ms 612 KB Output is correct
6 Correct 881 ms 612 KB Output is correct
7 Correct 879 ms 612 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 882 ms 480 KB Output is correct
13 Correct 881 ms 484 KB Output is correct
14 Correct 863 ms 484 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 901 ms 484 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 878 ms 612 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 880 ms 484 KB Output is correct
7 Correct 892 ms 744 KB Output is correct
8 Correct 959 ms 744 KB Output is correct
9 Correct 961 ms 740 KB Output is correct
10 Correct 954 ms 612 KB Output is correct
11 Correct 888 ms 740 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 128 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 125 ms 484 KB Output is correct
24 Correct 127 ms 388 KB Output is correct
25 Correct 127 ms 396 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 129 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 126 ms 440 KB Output is correct
31 Correct 128 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 129 ms 488 KB Output is correct
36 Correct 127 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 484 KB Output is correct
2 Correct 571 ms 484 KB Output is correct
3 Correct 872 ms 740 KB Output is correct
4 Correct 599 ms 596 KB Output is correct
5 Correct 925 ms 612 KB Output is correct
6 Correct 881 ms 612 KB Output is correct
7 Correct 879 ms 612 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 882 ms 480 KB Output is correct
13 Correct 881 ms 484 KB Output is correct
14 Correct 863 ms 484 KB Output is correct
15 Correct 901 ms 484 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 878 ms 612 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 880 ms 484 KB Output is correct
21 Correct 892 ms 744 KB Output is correct
22 Correct 959 ms 744 KB Output is correct
23 Correct 961 ms 740 KB Output is correct
24 Correct 954 ms 612 KB Output is correct
25 Correct 888 ms 740 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 0 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 128 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 125 ms 484 KB Output is correct
49 Correct 127 ms 388 KB Output is correct
50 Correct 127 ms 396 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 129 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 126 ms 440 KB Output is correct
56 Correct 128 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 129 ms 488 KB Output is correct
61 Correct 127 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 566 ms 488 KB Output is correct
64 Correct 571 ms 492 KB Output is correct
65 Correct 875 ms 740 KB Output is correct
66 Correct 591 ms 624 KB Output is correct
67 Correct 886 ms 612 KB Output is correct
68 Correct 888 ms 740 KB Output is correct
69 Correct 894 ms 868 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 268 KB Output is correct
72 Correct 866 ms 740 KB Output is correct
73 Correct 887 ms 644 KB Output is correct
74 Correct 889 ms 636 KB Output is correct
75 Correct 883 ms 748 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 907 ms 612 KB Output is correct
79 Correct 903 ms 616 KB Output is correct
80 Correct 964 ms 740 KB Output is correct
81 Correct 933 ms 640 KB Output is correct
82 Correct 973 ms 636 KB Output is correct
83 Correct 894 ms 644 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 125 ms 364 KB Output is correct
86 Correct 889 ms 632 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 129 ms 364 KB Output is correct
90 Correct 127 ms 364 KB Output is correct
91 Correct 128 ms 364 KB Output is correct
92 Correct 946 ms 640 KB Output is correct
93 Correct 951 ms 740 KB Output is correct
94 Correct 971 ms 612 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 872 ms 636 KB Output is correct
98 Correct 124 ms 364 KB Output is correct
99 Correct 865 ms 612 KB Output is correct
100 Correct 1 ms 364 KB Output is correct
101 Correct 130 ms 364 KB Output is correct
102 Correct 127 ms 360 KB Output is correct
103 Correct 887 ms 744 KB Output is correct
104 Correct 1 ms 364 KB Output is correct
105 Correct 1 ms 360 KB Output is correct
106 Correct 1 ms 364 KB Output is correct
107 Correct 133 ms 544 KB Output is correct
108 Correct 128 ms 364 KB Output is correct
109 Correct 951 ms 636 KB Output is correct
110 Correct 951 ms 644 KB Output is correct
111 Correct 1 ms 364 KB Output is correct