Submission #27923

# Submission time Handle Problem Language Result Execution time Memory
27923 2017-07-14T12:28:35 Z repeating Cave (IOI13_cave) C++11
100 / 100
516 ms 640 KB
#include <bits/stdc++.h>
#include "cave.h"
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%I64d",&x)
#define SF2(x,y) scanf("%I64d%I64d",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()

using namespace std;
const long long INF = 1e9;
const int MX=100005;





int s[5005];
int pos[5005];
int a[5005];
int res[5005];
int out[5005];
bool b[5005];
int n;
void pre(int x,int &l,int &r){
    int ret1,ret2;

    int mid=(l+r)/2;
    ret1=tryCombination(a);
    for(int i=l;i<=mid;i++){
        if(b[i])C;
        a[i]=1;
    }
    ret2=tryCombination(a);
    for(int i=l;i<=mid;i++){
        if(b[i])C;
        a[i]=0;
    }
    if(ret1==ret2||(ret1!=x&&ret2!=x)){
        if(ret1==x&&ret2==x)pos[x]=1;
        else{pos[x]=0;}
        l=mid+1;
    }
    else{
        if(ret1==x)pos[x]=1;
        else pos[x]=0;
        r=mid;
    }

}
void check(int x){
    int l=0,r=n,ret1,ret2;
    pre(x,l,r);
    W(l<r){
        int mid=(l+r)/2;
        for(int i=l;i<=mid;i++){
            if(b[i])C;
            a[i]=(pos[x]^1);
        }
        for(int i=mid+1;i<=r;i++){
            if(b[i])C;
            a[i]=pos[x];
        }
        ret1=tryCombination(a);
        for(int i=l;i<=r;i++){
            if(b[i])C;
            a[i]=0;
        }
        if(ret1==x){
            r=mid;
        }
        else{
            l=mid+1;
        }
    }
    b[l]=1;
    a[l]=pos[x];
    out[l]=pos[x];
    res[l]=x;
}
void exploreCave(int N) {
    n=N;
    for(int i=0;i<N;i++){
        check(i);
    }
    answer(out,res);
}

Compilation message

cave.cpp: In function 'void check(int)':
cave.cpp:64:22: warning: unused variable 'ret2' [-Wunused-variable]
     int l=0,r=n,ret1,ret2;
                      ^~~~
# Verdict Execution time Memory Grader output
1 Correct 201 ms 512 KB Output is correct
2 Correct 160 ms 516 KB Output is correct
3 Correct 241 ms 516 KB Output is correct
4 Correct 158 ms 504 KB Output is correct
5 Correct 375 ms 532 KB Output is correct
6 Correct 305 ms 524 KB Output is correct
7 Correct 288 ms 504 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 231 ms 504 KB Output is correct
13 Correct 312 ms 504 KB Output is correct
14 Correct 237 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 310 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 284 ms 512 KB Output is correct
4 Correct 6 ms 396 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 315 ms 524 KB Output is correct
7 Correct 253 ms 536 KB Output is correct
8 Correct 437 ms 532 KB Output is correct
9 Correct 468 ms 640 KB Output is correct
10 Correct 499 ms 524 KB Output is correct
11 Correct 266 ms 548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 396 KB Output is correct
8 Correct 6 ms 356 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 396 KB Output is correct
8 Correct 6 ms 356 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 396 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 5 ms 396 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 40 ms 476 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 79 ms 436 KB Output is correct
24 Correct 75 ms 384 KB Output is correct
25 Correct 76 ms 512 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 55 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 39 ms 512 KB Output is correct
31 Correct 46 ms 464 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 64 ms 384 KB Output is correct
36 Correct 58 ms 492 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 201 ms 512 KB Output is correct
2 Correct 160 ms 516 KB Output is correct
3 Correct 241 ms 516 KB Output is correct
4 Correct 158 ms 504 KB Output is correct
5 Correct 375 ms 532 KB Output is correct
6 Correct 305 ms 524 KB Output is correct
7 Correct 288 ms 504 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 231 ms 504 KB Output is correct
13 Correct 312 ms 504 KB Output is correct
14 Correct 237 ms 504 KB Output is correct
15 Correct 310 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 284 ms 512 KB Output is correct
18 Correct 6 ms 396 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 315 ms 524 KB Output is correct
21 Correct 253 ms 536 KB Output is correct
22 Correct 437 ms 532 KB Output is correct
23 Correct 468 ms 640 KB Output is correct
24 Correct 499 ms 524 KB Output is correct
25 Correct 266 ms 548 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 6 ms 396 KB Output is correct
33 Correct 6 ms 356 KB Output is correct
34 Correct 6 ms 332 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 6 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 396 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 5 ms 396 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 40 ms 476 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 5 ms 332 KB Output is correct
48 Correct 79 ms 436 KB Output is correct
49 Correct 75 ms 384 KB Output is correct
50 Correct 76 ms 512 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 55 ms 384 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 39 ms 512 KB Output is correct
56 Correct 46 ms 464 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 6 ms 384 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 64 ms 384 KB Output is correct
61 Correct 58 ms 492 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 197 ms 532 KB Output is correct
64 Correct 185 ms 496 KB Output is correct
65 Correct 277 ms 520 KB Output is correct
66 Correct 179 ms 552 KB Output is correct
67 Correct 396 ms 532 KB Output is correct
68 Correct 250 ms 488 KB Output is correct
69 Correct 325 ms 504 KB Output is correct
70 Correct 6 ms 384 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 253 ms 504 KB Output is correct
73 Correct 248 ms 528 KB Output is correct
74 Correct 269 ms 504 KB Output is correct
75 Correct 273 ms 548 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 329 ms 488 KB Output is correct
79 Correct 240 ms 524 KB Output is correct
80 Correct 478 ms 640 KB Output is correct
81 Correct 477 ms 640 KB Output is correct
82 Correct 516 ms 640 KB Output is correct
83 Correct 350 ms 504 KB Output is correct
84 Correct 5 ms 512 KB Output is correct
85 Correct 40 ms 512 KB Output is correct
86 Correct 325 ms 504 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 7 ms 384 KB Output is correct
89 Correct 60 ms 384 KB Output is correct
90 Correct 58 ms 384 KB Output is correct
91 Correct 79 ms 512 KB Output is correct
92 Correct 401 ms 640 KB Output is correct
93 Correct 428 ms 588 KB Output is correct
94 Correct 407 ms 524 KB Output is correct
95 Correct 5 ms 512 KB Output is correct
96 Correct 6 ms 384 KB Output is correct
97 Correct 328 ms 512 KB Output is correct
98 Correct 36 ms 512 KB Output is correct
99 Correct 255 ms 504 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 50 ms 476 KB Output is correct
102 Correct 49 ms 512 KB Output is correct
103 Correct 235 ms 516 KB Output is correct
104 Correct 6 ms 512 KB Output is correct
105 Correct 5 ms 384 KB Output is correct
106 Correct 6 ms 512 KB Output is correct
107 Correct 59 ms 384 KB Output is correct
108 Correct 67 ms 512 KB Output is correct
109 Correct 460 ms 512 KB Output is correct
110 Correct 425 ms 528 KB Output is correct
111 Correct 6 ms 512 KB Output is correct