Submission #29826

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
29826	2017-07-21T07:58:48 Z	kavun	Cave (IOI13_cave)	C++14	46 / 100	35 ms	640 KB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;
int n, s[5010], firstclosed, d[5010], correct[5010], done;
bool mk[5010];


void exploreCave(int N) {
  n = N;

  firstclosed = tryCombination(s);
  if(firstclosed == -1) firstclosed = n;
  for(int i = 0; done < n; i = (i+1) % n)
    {
      if(mk[i]) continue;
      s[i] ^= 1;
      int pos = tryCombination(s);
      if(pos == -1)
	{
	  correct[i] = s[i];
	  d[i] = firstclosed;
	  done++;
	  firstclosed = n;
	  mk[i] = true;
	  continue;
	}
      if(pos < firstclosed)
	{
	  correct[i] = s[i] ^ 1;
	  d[i] = pos;
	  done++;
	  s[i] ^= 1;
	  mk[i] = true;
	}
      if(pos > firstclosed)
	{
	  correct[i] = s[i];
	  d[i] = firstclosed;
	  done++;
	  firstclosed = pos;
	  mk[i] = true;
	}
    }
  for(int i = 0; i < n; i++)
    s[i] = correct[i];

  answer(s,d);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	512 KB	Output is correct
2	Correct	16 ms	520 KB	Output is correct
3	Correct	17 ms	520 KB	Output is correct
4	Correct	35 ms	512 KB	Output is correct
5	Correct	17 ms	524 KB	Output is correct
6	Correct	18 ms	512 KB	Output is correct
7	Correct	23 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	512 KB	Output is correct
11	Correct	6 ms	512 KB	Output is correct
12	Correct	23 ms	512 KB	Output is correct
13	Correct	19 ms	512 KB	Output is correct
14	Correct	19 ms	524 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	640 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	21 ms	524 KB	Output is correct
4	Correct	5 ms	512 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	17 ms	580 KB	Output is correct
7	Correct	21 ms	452 KB	Output is correct
8	Correct	20 ms	500 KB	Output is correct
9	Correct	20 ms	492 KB	Output is correct
10	Correct	26 ms	572 KB	Output is correct
11	Correct	20 ms	512 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	452 KB	Output is correct
2	Correct	5 ms	384 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	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	6 ms	384 KB	Output is correct
12	Correct	6 ms	512 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	396 KB	Output is correct

Subtask #4

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	452 KB	Output is correct
2	Correct	5 ms	384 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	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	6 ms	384 KB	Output is correct
12	Correct	6 ms	512 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	396 KB	Output is correct
15	Correct	6 ms	420 KB	Output is correct
16	Correct	6 ms	324 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	6 ms	512 KB	Output is correct
19	Correct	6 ms	452 KB	Output is correct
20	Incorrect	12 ms	512 KB	too much calls on tryCombination()
21	Halted	0 ms	0 KB	-

Subtask #5

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	512 KB	Output is correct
2	Correct	16 ms	520 KB	Output is correct
3	Correct	17 ms	520 KB	Output is correct
4	Correct	35 ms	512 KB	Output is correct
5	Correct	17 ms	524 KB	Output is correct
6	Correct	18 ms	512 KB	Output is correct
7	Correct	23 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	512 KB	Output is correct
11	Correct	6 ms	512 KB	Output is correct
12	Correct	23 ms	512 KB	Output is correct
13	Correct	19 ms	512 KB	Output is correct
14	Correct	19 ms	524 KB	Output is correct
15	Correct	17 ms	640 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	21 ms	524 KB	Output is correct
18	Correct	5 ms	512 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	17 ms	580 KB	Output is correct
21	Correct	21 ms	452 KB	Output is correct
22	Correct	20 ms	500 KB	Output is correct
23	Correct	20 ms	492 KB	Output is correct
24	Correct	26 ms	572 KB	Output is correct
25	Correct	20 ms	512 KB	Output is correct
26	Correct	6 ms	452 KB	Output is correct
27	Correct	5 ms	384 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	5 ms	384 KB	Output is correct
33	Correct	5 ms	384 KB	Output is correct
34	Correct	5 ms	384 KB	Output is correct
35	Correct	5 ms	384 KB	Output is correct
36	Correct	6 ms	384 KB	Output is correct
37	Correct	6 ms	512 KB	Output is correct
38	Correct	5 ms	384 KB	Output is correct
39	Correct	5 ms	396 KB	Output is correct
40	Correct	6 ms	420 KB	Output is correct
41	Correct	6 ms	324 KB	Output is correct
42	Correct	5 ms	384 KB	Output is correct
43	Correct	6 ms	512 KB	Output is correct
44	Correct	6 ms	452 KB	Output is correct
45	Incorrect	12 ms	512 KB	too much calls on tryCombination()
46	Halted	0 ms	0 KB	-