oj.uz

Submission #96179

# Submission time Handle Problem Language Result Execution time Memory
96179 2019-02-06T17:59:22 Z liwi Cave (IOI13_cave) C++11
100 / 100
 1218 ms 640 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "cave.h"
 
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
 
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
 
#define MAXN 5001
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
 
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
 
int len,init,curr,guess[MAXN],res[MAXN],back[MAXN];
//int real_back[MAXN]={3,0,1,2},order[MAXN]={1,0,1,0};
bool done[MAXN];
//
//void answer(int S[MAXN], int D[MAXN]){
//    for(int i=0; i<len; i++){
//        if(S[i] != order[i]){
//            printf("SWITCH %d WRONG ORDER\n",i);
//            exit(0);
//        }
//    }
//    for(int i=0; i<len; i++){
//        if(D[i] != real_back[i]){
//            printf("SWITCH %d MAPPED TO WRONG DOOR",i);
//            exit(0);
//        }
//    }
//    printf("AC\n");
//}
//
//int tryCombination(int S[MAXN]){
//    int res = INT_MAX;
//    for(int i=0; i<len; i++)
//        if(S[i] != order[i])
//            res = min(res,real_back[i]);
//    if(res == INT_MAX) return -1;
//    return res;
//}
 
void solve(int l, int r){
    for(int i=0; i<len; i++){
        if(done[i]) guess[i] = res[i];
        else guess[i] = 0;
    }
    for(int i=l; i<=(l+r)/2; i++){
        if(done[i]) guess[i] = res[i];
        else guess[i] = 1;
    }
    if(l == r){
        if(init) res[l] = 1;
        else res[l] = 0;
        done[l] = true;
        back[l] = curr;
        return;
    }
  	int mid = (l+r)/2, current = (tryCombination(guess)==curr?1:0);
    if(current == init) solve(mid+1,r);
    else solve(l,mid);
}
 
void exploreCave(int N){
    len = N;
    for(curr=0; curr<N; curr++){
        for(int k=0; k<N; k++){
            if(done[k]) guess[k] = res[k];
            else guess[k] = 0;
        }
        init = (tryCombination(guess)==curr?1:0);
        solve(0,N-1);
    }
    answer(res,back);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 516 KB Output is correct
2 Correct 573 ms 492 KB Output is correct
3 Correct 535 ms 508 KB Output is correct
4 Correct 400 ms 504 KB Output is correct
5 Correct 903 ms 512 KB Output is correct
6 Correct 544 ms 492 KB Output is correct
7 Correct 755 ms 524 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 527 ms 512 KB Output is correct
13 Correct 528 ms 532 KB Output is correct
14 Correct 618 ms 496 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 677 ms 544 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 676 ms 516 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 420 KB Output is correct
6 Correct 622 ms 512 KB Output is correct
7 Correct 569 ms 524 KB Output is correct
8 Correct 1218 ms 640 KB Output is correct
9 Correct 1147 ms 512 KB Output is correct
10 Correct 1165 ms 640 KB Output is correct
11 Correct 615 ms 496 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 452 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 324 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 452 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 83 ms 512 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 181 ms 452 KB Output is correct
24 Correct 167 ms 384 KB Output is correct
25 Correct 174 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 102 ms 512 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 115 ms 512 KB Output is correct
31 Correct 98 ms 468 KB Output is correct
32 Correct 5 ms 396 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 7 ms 452 KB Output is correct
35 Correct 137 ms 480 KB Output is correct
36 Correct 149 ms 464 KB Output is correct
37 Correct 5 ms 396 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 516 KB Output is correct
2 Correct 573 ms 492 KB Output is correct
3 Correct 535 ms 508 KB Output is correct
4 Correct 400 ms 504 KB Output is correct
5 Correct 903 ms 512 KB Output is correct
6 Correct 544 ms 492 KB Output is correct
7 Correct 755 ms 524 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 527 ms 512 KB Output is correct
13 Correct 528 ms 532 KB Output is correct
14 Correct 618 ms 496 KB Output is correct
15 Correct 677 ms 544 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 676 ms 516 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 6 ms 420 KB Output is correct
20 Correct 622 ms 512 KB Output is correct
21 Correct 569 ms 524 KB Output is correct
22 Correct 1218 ms 640 KB Output is correct
23 Correct 1147 ms 512 KB Output is correct
24 Correct 1165 ms 640 KB Output is correct
25 Correct 615 ms 496 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 452 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 324 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 452 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 5 ms 460 KB Output is correct
45 Correct 83 ms 512 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 6 ms 512 KB Output is correct
48 Correct 181 ms 452 KB Output is correct
49 Correct 167 ms 384 KB Output is correct
50 Correct 174 ms 384 KB Output is correct
51 Correct 5 ms 512 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 102 ms 512 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 115 ms 512 KB Output is correct
56 Correct 98 ms 468 KB Output is correct
57 Correct 5 ms 396 KB Output is correct
58 Correct 6 ms 384 KB Output is correct
59 Correct 7 ms 452 KB Output is correct
60 Correct 137 ms 480 KB Output is correct
61 Correct 149 ms 464 KB Output is correct
62 Correct 5 ms 396 KB Output is correct
63 Correct 359 ms 488 KB Output is correct
64 Correct 309 ms 516 KB Output is correct
65 Correct 562 ms 452 KB Output is correct
66 Correct 433 ms 508 KB Output is correct
67 Correct 666 ms 504 KB Output is correct
68 Correct 693 ms 516 KB Output is correct
69 Correct 787 ms 496 KB Output is correct
70 Correct 6 ms 512 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 646 ms 508 KB Output is correct
73 Correct 539 ms 516 KB Output is correct
74 Correct 669 ms 492 KB Output is correct
75 Correct 592 ms 496 KB Output is correct
76 Correct 5 ms 512 KB Output is correct
77 Correct 6 ms 384 KB Output is correct
78 Correct 648 ms 488 KB Output is correct
79 Correct 744 ms 532 KB Output is correct
80 Correct 1059 ms 512 KB Output is correct
81 Correct 1206 ms 640 KB Output is correct
82 Correct 1156 ms 516 KB Output is correct
83 Correct 584 ms 488 KB Output is correct
84 Correct 6 ms 512 KB Output is correct
85 Correct 96 ms 384 KB Output is correct
86 Correct 560 ms 496 KB Output is correct
87 Correct 5 ms 512 KB Output is correct
88 Correct 6 ms 396 KB Output is correct
89 Correct 131 ms 384 KB Output is correct
90 Correct 131 ms 512 KB Output is correct
91 Correct 129 ms 512 KB Output is correct
92 Correct 1078 ms 580 KB Output is correct
93 Correct 1124 ms 640 KB Output is correct
94 Correct 1083 ms 532 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 5 ms 384 KB Output is correct
97 Correct 469 ms 504 KB Output is correct
98 Correct 87 ms 384 KB Output is correct
99 Correct 548 ms 516 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 99 ms 512 KB Output is correct
102 Correct 80 ms 456 KB Output is correct
103 Correct 522 ms 504 KB Output is correct
104 Correct 6 ms 384 KB Output is correct
105 Correct 6 ms 384 KB Output is correct
106 Correct 6 ms 512 KB Output is correct
107 Correct 144 ms 468 KB Output is correct
108 Correct 131 ms 512 KB Output is correct
109 Correct 1117 ms 516 KB Output is correct
110 Correct 1136 ms 532 KB Output is correct
111 Correct 5 ms 384 KB Output is correct