Submission #985380

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
985380	2024-05-17T17:10:59 Z	user736482	Cave (IOI13_cave)	C++17	12 / 100	149 ms	796 KB

cave

#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
bool fixed_[5000];
int match[5000],result[5000],openstate,ak;
void change(int a, int b, bool c){
    for(int i=a;i<=b;i++){
        if(!fixed_[i])
            result[i]= c;
    }
}

void exploreCave(int n){
    for(int i=0;i<n;i++){
        int pocz=0;
        int kon=n-1;
        change(pocz,kon,1);
        ak=tryCombination(result);
        if(ak==i)
            openstate=0;
        else
            openstate=1;
        while(pocz<kon){
            int sr=(pocz+kon)/2;
            change(pocz,sr,openstate);
            change(sr+1,kon,!openstate);
            ak=tryCombination(result);
            if(ak==i)
                pocz=sr+1;
            else
                kon=sr;
        }
        result[pocz]=openstate;
        match[i]=pocz;
        fixed_[pocz]=1;
    }
    answer(result,match);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	91 ms	344 KB	Output is correct
2	Correct	88 ms	348 KB	Output is correct
3	Correct	143 ms	344 KB	Output is correct
4	Correct	96 ms	344 KB	Output is correct
5	Correct	136 ms	600 KB	Output is correct
6	Correct	149 ms	548 KB	Output is correct
7	Correct	137 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	133 ms	796 KB	Output is correct
13	Correct	132 ms	540 KB	Output is correct
14	Correct	131 ms	344 KB	Output is correct

Subtask #2

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	146 ms	600 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	145 ms	516 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	134 ms	516 KB	Answer is wrong
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Incorrect	1 ms	348 KB	Answer is wrong
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Incorrect	1 ms	348 KB	Answer is wrong
8	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	91 ms	344 KB	Output is correct
2	Correct	88 ms	348 KB	Output is correct
3	Correct	143 ms	344 KB	Output is correct
4	Correct	96 ms	344 KB	Output is correct
5	Correct	136 ms	600 KB	Output is correct
6	Correct	149 ms	548 KB	Output is correct
7	Correct	137 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	133 ms	796 KB	Output is correct
13	Correct	132 ms	540 KB	Output is correct
14	Correct	131 ms	344 KB	Output is correct
15	Correct	146 ms	600 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	145 ms	516 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Incorrect	134 ms	516 KB	Answer is wrong
21	Halted	0 ms	0 KB	-