oj.uz

Submission #551506

# Submission time Handle Problem Language Result Execution time Memory
551506 2022-04-20T22:00:07 Z beedle Cave (IOI13_cave) C++17
100 / 100
 976 ms 528 KB 
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#define pi 3.141592653589793238
#define ll long long
#define ld long double
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define mod 998244353ll
#define INF 1000000000000000000
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin (), (x).end ()
#define sz(x) (ll) (x).size ()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rank rnk
#define log lg
#define fast                                                                  \
    ios_base::sync_with_stdio (false);                                        \
    cin.tie (NULL);                                                           \
    cout.tie (NULL)

#include "cave.h"
 
using namespace std;

// int tryCombination(int s[])
// {
//     int n=4;
//     rep(i,0,n-1)
//     cout<<s[i]<<" ";
//     cout<<endl;
//     fflush(stdout);
//     int x;
//     cin>>x;
//     return x;
// }

// void answer(int s[], int d[])
// {
//     int n=4;
//     rep(i,0,n-1)
//     cout<<s[i]<<" ";
//     cout<<endl;
//     rep(i,0,n-1)
//     cout<<d[i]<<" ";
//     cout<<endl;
//     fflush(stdout);
// }

void exploreCave(int n)
{
    bool known[n];
    rep(i,0,n-1)
    known[i]=false;
    int actual[n];
    int binding[n];
    
    vector <int> idx;
    rep(i,0,n-1)
    idx.pb(i);

    rep(door,0,n-1)
    {
        int q[n];
        for(auto x:idx)
        q[x]=0;
        rep(i,0,n-1)
        if(known[i])
        q[i]=actual[i];

        int ans=tryCombination(q);
        int expected;
        if(ans==-1 || ans>door)
        expected=0;
        else
        expected=1;

        int lo=0;
        int hi=sz(idx)-1;

        while(hi-lo!=0)
        {
            int mid=(lo+hi)/2;

            rep(i,0,n-1)
            if(known[i])
            q[i]=actual[i];

            rep(i,lo,mid)
            q[idx[i]]=expected;
            rep(i,mid+1,hi)
            q[idx[i]]=1^expected;

            ans=tryCombination(q);

            if(ans==-1 || ans>door)
            {
                hi=mid;
            }
            else
            {
                lo=mid+1;
            }
        }

        known[idx[hi]]=true;
        binding[idx[hi]]=door;
        actual[idx[hi]]=expected;

        // cout<<"SAYING"<<endl;
        // cout<<idx[hi]<<" "<<expected<<endl<<endl;

        vector <int> nidx;
        for(auto x:idx)
        if(x!=idx[hi])
        nidx.pb(x);

        idx=nidx;
    }

    answer(actual,binding);
}

// signed main()
// {
//     // fast;

//     // freopen("milkorder.in","r",stdin);
//     // freopen("milkorder.out","w",stdout);

//     exploreCave(4);

//     return 0;
// }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 428 KB Output is correct
2 Correct 333 ms 468 KB Output is correct
3 Correct 525 ms 512 KB Output is correct
4 Correct 364 ms 488 KB Output is correct
5 Correct 535 ms 512 KB Output is correct
6 Correct 545 ms 524 KB Output is correct
7 Correct 539 ms 468 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 529 ms 508 KB Output is correct
13 Correct 524 ms 468 KB Output is correct
14 Correct 511 ms 512 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 472 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 564 ms 512 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 521 ms 508 KB Output is correct
7 Correct 556 ms 516 KB Output is correct
8 Correct 939 ms 508 KB Output is correct
9 Correct 924 ms 508 KB Output is correct
10 Correct 976 ms 524 KB Output is correct
11 Correct 459 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 304 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 304 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 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 67 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 115 ms 372 KB Output is correct
24 Correct 146 ms 376 KB Output is correct
25 Correct 119 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 68 ms 376 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 74 ms 376 KB Output is correct
31 Correct 72 ms 372 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 304 KB Output is correct
35 Correct 118 ms 340 KB Output is correct
36 Correct 115 ms 376 KB Output is correct
37 Correct 1 ms 300 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 428 KB Output is correct
2 Correct 333 ms 468 KB Output is correct
3 Correct 525 ms 512 KB Output is correct
4 Correct 364 ms 488 KB Output is correct
5 Correct 535 ms 512 KB Output is correct
6 Correct 545 ms 524 KB Output is correct
7 Correct 539 ms 468 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 529 ms 508 KB Output is correct
13 Correct 524 ms 468 KB Output is correct
14 Correct 511 ms 512 KB Output is correct
15 Correct 537 ms 472 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 564 ms 512 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 521 ms 508 KB Output is correct
21 Correct 556 ms 516 KB Output is correct
22 Correct 939 ms 508 KB Output is correct
23 Correct 924 ms 508 KB Output is correct
24 Correct 976 ms 524 KB Output is correct
25 Correct 459 ms 512 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 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 304 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 304 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 67 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 115 ms 372 KB Output is correct
49 Correct 146 ms 376 KB Output is correct
50 Correct 119 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 68 ms 376 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 74 ms 376 KB Output is correct
56 Correct 72 ms 372 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 304 KB Output is correct
60 Correct 118 ms 340 KB Output is correct
61 Correct 115 ms 376 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 335 ms 468 KB Output is correct
64 Correct 350 ms 468 KB Output is correct
65 Correct 536 ms 520 KB Output is correct
66 Correct 349 ms 484 KB Output is correct
67 Correct 525 ms 508 KB Output is correct
68 Correct 519 ms 512 KB Output is correct
69 Correct 559 ms 524 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 547 ms 508 KB Output is correct
73 Correct 501 ms 508 KB Output is correct
74 Correct 517 ms 516 KB Output is correct
75 Correct 561 ms 508 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 502 ms 508 KB Output is correct
79 Correct 477 ms 512 KB Output is correct
80 Correct 915 ms 516 KB Output is correct
81 Correct 912 ms 512 KB Output is correct
82 Correct 971 ms 528 KB Output is correct
83 Correct 456 ms 512 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 91 ms 372 KB Output is correct
86 Correct 456 ms 468 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 123 ms 340 KB Output is correct
90 Correct 126 ms 372 KB Output is correct
91 Correct 119 ms 372 KB Output is correct
92 Correct 926 ms 508 KB Output is correct
93 Correct 927 ms 508 KB Output is correct
94 Correct 953 ms 508 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 300 KB Output is correct
97 Correct 519 ms 512 KB Output is correct
98 Correct 79 ms 340 KB Output is correct
99 Correct 481 ms 508 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 73 ms 368 KB Output is correct
102 Correct 78 ms 368 KB Output is correct
103 Correct 493 ms 512 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 300 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 125 ms 368 KB Output is correct
108 Correct 119 ms 372 KB Output is correct
109 Correct 937 ms 512 KB Output is correct
110 Correct 968 ms 516 KB Output is correct
111 Correct 1 ms 212 KB Output is correct