Submission #63710

# Submission time Handle Problem Language Result Execution time Memory
63710 2018-08-02T14:13:25 Z MKopchev Cave (IOI13_cave) C++14
100 / 100
1198 ms 644 KB
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
const int nmax=5e3+42;
int which[nmax];
int sign[nmax];
int now[nmax];
int active[nmax],sz=0;
/*
bool open[4]={1,1,1,0};
int order[4]={3,1,0,2};
bool open_now[4];
int tryCombination(int nnn[])
{
    cout<<"testing: ";for(int i=0;i<4;i++)cout<<nnn[i]<<" ";
    int N=4;
    for(int i=0;i<N;i++)
        if(open[i]==nnn[i])open_now[order[i]]=1;
        else open_now[order[i]]=0;
    int p=0;
    while(open_now[p])p++;
    cout<<" -> "<<p<<endl;
    if(p==N)return -1;
    return p;
}
*/
void exploreCave(int N)
{
    memset(which,-1,sizeof(which));
    for(int i=0;i<N;i++)//find the i-th
    {
        sz=0;
        for(int j=0;j<N;j++)
            if(which[j]!=-1)now[j]=sign[j];
            else
            {
            sz++;
            active[sz]=j;
            now[j]=0;
            }
        int ans=tryCombination(now);
        bool sign_now;
        //assert(ans==-1||ans>=i);
        if(ans==-1||ans>i)sign_now=0;
        else sign_now=1;
        while(sz>1)
        {
            int mx=sz/2,pos=1;
            for(int j=0;j<N;j++)
                if(which[j]!=-1)now[j]=sign[j];
                else
                {
                if(pos<=mx&&active[pos]==j)now[j]=sign_now,pos++;
                else now[j]=!sign_now;
                }
            int ans=tryCombination(now);
            //assert(ans==-1||ans>=i);
            if(ans==-1||ans>i)sz=mx;
            else
            {
                for(int j=mx+1;j<=sz;j++)
                    active[j-mx]=active[j];
                sz=sz-mx;
            }
        }
        sign[active[1]]=sign_now;
        which[active[1]]=i;
        //cout<<i<<"-th must be "<<active[1]<<" and the sign is "<<sign_now<<endl;
    }
    answer(sign,which);
    //cout<<"sign:  ";for(int i=0;i<N;i++)cout<<sign[i]<<" ";cout<<endl;
    //cout<<"which: ";for(int i=0;i<N;i++)cout<<which[i]<<" ";cout<<endl;
}
/*
int main()
{
    exploreCave(4);
}
*/
# Verdict Execution time Memory Grader output
1 Correct 233 ms 640 KB Output is correct
2 Correct 356 ms 640 KB Output is correct
3 Correct 423 ms 580 KB Output is correct
4 Correct 329 ms 640 KB Output is correct
5 Correct 434 ms 520 KB Output is correct
6 Correct 471 ms 512 KB Output is correct
7 Correct 464 ms 520 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 601 ms 516 KB Output is correct
13 Correct 454 ms 536 KB Output is correct
14 Correct 468 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 457 ms 544 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 655 ms 640 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 450 ms 512 KB Output is correct
7 Correct 484 ms 520 KB Output is correct
8 Correct 1148 ms 528 KB Output is correct
9 Correct 1138 ms 532 KB Output is correct
10 Correct 1075 ms 532 KB Output is correct
11 Correct 714 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 452 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 452 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 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 384 KB Output is correct
20 Correct 102 ms 484 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 130 ms 512 KB Output is correct
24 Correct 152 ms 480 KB Output is correct
25 Correct 127 ms 512 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 70 ms 476 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 84 ms 484 KB Output is correct
31 Correct 77 ms 488 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 332 KB Output is correct
34 Correct 6 ms 460 KB Output is correct
35 Correct 147 ms 512 KB Output is correct
36 Correct 138 ms 512 KB Output is correct
37 Correct 5 ms 452 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 233 ms 640 KB Output is correct
2 Correct 356 ms 640 KB Output is correct
3 Correct 423 ms 580 KB Output is correct
4 Correct 329 ms 640 KB Output is correct
5 Correct 434 ms 520 KB Output is correct
6 Correct 471 ms 512 KB Output is correct
7 Correct 464 ms 520 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 601 ms 516 KB Output is correct
13 Correct 454 ms 536 KB Output is correct
14 Correct 468 ms 512 KB Output is correct
15 Correct 457 ms 544 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 655 ms 640 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 450 ms 512 KB Output is correct
21 Correct 484 ms 520 KB Output is correct
22 Correct 1148 ms 528 KB Output is correct
23 Correct 1138 ms 532 KB Output is correct
24 Correct 1075 ms 532 KB Output is correct
25 Correct 714 ms 512 KB Output is correct
26 Correct 6 ms 452 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 6 ms 512 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 6 ms 512 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 5 ms 460 KB Output is correct
40 Correct 6 ms 512 KB Output is correct
41 Correct 5 ms 384 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 384 KB Output is correct
45 Correct 102 ms 484 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 130 ms 512 KB Output is correct
49 Correct 152 ms 480 KB Output is correct
50 Correct 127 ms 512 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 70 ms 476 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 84 ms 484 KB Output is correct
56 Correct 77 ms 488 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 6 ms 332 KB Output is correct
59 Correct 6 ms 460 KB Output is correct
60 Correct 147 ms 512 KB Output is correct
61 Correct 138 ms 512 KB Output is correct
62 Correct 5 ms 452 KB Output is correct
63 Correct 341 ms 548 KB Output is correct
64 Correct 330 ms 512 KB Output is correct
65 Correct 511 ms 516 KB Output is correct
66 Correct 282 ms 640 KB Output is correct
67 Correct 508 ms 528 KB Output is correct
68 Correct 600 ms 640 KB Output is correct
69 Correct 457 ms 512 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 6 ms 384 KB Output is correct
72 Correct 490 ms 532 KB Output is correct
73 Correct 438 ms 524 KB Output is correct
74 Correct 512 ms 520 KB Output is correct
75 Correct 572 ms 528 KB Output is correct
76 Correct 5 ms 512 KB Output is correct
77 Correct 5 ms 512 KB Output is correct
78 Correct 528 ms 640 KB Output is correct
79 Correct 572 ms 640 KB Output is correct
80 Correct 1110 ms 640 KB Output is correct
81 Correct 1053 ms 580 KB Output is correct
82 Correct 1113 ms 640 KB Output is correct
83 Correct 566 ms 640 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 96 ms 512 KB Output is correct
86 Correct 690 ms 532 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 8 ms 384 KB Output is correct
89 Correct 179 ms 512 KB Output is correct
90 Correct 157 ms 480 KB Output is correct
91 Correct 150 ms 384 KB Output is correct
92 Correct 1067 ms 544 KB Output is correct
93 Correct 1031 ms 528 KB Output is correct
94 Correct 1078 ms 532 KB Output is correct
95 Correct 7 ms 384 KB Output is correct
96 Correct 6 ms 512 KB Output is correct
97 Correct 543 ms 644 KB Output is correct
98 Correct 63 ms 384 KB Output is correct
99 Correct 419 ms 640 KB Output is correct
100 Correct 5 ms 512 KB Output is correct
101 Correct 72 ms 384 KB Output is correct
102 Correct 72 ms 608 KB Output is correct
103 Correct 514 ms 640 KB Output is correct
104 Correct 5 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 122 ms 484 KB Output is correct
108 Correct 149 ms 484 KB Output is correct
109 Correct 1198 ms 532 KB Output is correct
110 Correct 1027 ms 640 KB Output is correct
111 Correct 6 ms 512 KB Output is correct