#include "bulb.h"
int n;
int done[1010];
int bulb[1010];
void Init(int N) {
// do nothing
n = N;
}
int MakeTurn(int M)
{
done[M] = 1;
bulb[M] ^= 1;
bulb[M-1] ^= 1;
int nxt = 0;
int mx = -1;
for(int i=1; i<=n; i++)
{
if(done[i]) continue;
if(bulb[i-1] + bulb[i] > mx)
{
mx = bulb[i-1] + bulb[i];
nxt = i;
}
}
bulb[nxt-1] ^= 1;
bulb[nxt] ^= 1;
done[nxt] = 1;
return nxt;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1136 KB |
Output is correct |
2 |
Correct |
0 ms |
1136 KB |
Output is correct |
3 |
Correct |
0 ms |
1136 KB |
Output is correct |
4 |
Correct |
0 ms |
1136 KB |
Output is correct |
5 |
Correct |
0 ms |
1136 KB |
Output is correct |
6 |
Correct |
0 ms |
1136 KB |
Output is correct |
7 |
Correct |
0 ms |
1136 KB |
Output is correct |
8 |
Correct |
0 ms |
1136 KB |
Output is correct |
9 |
Correct |
0 ms |
1136 KB |
Output is correct |
10 |
Correct |
0 ms |
1136 KB |
Output is correct |
11 |
Correct |
0 ms |
1136 KB |
Output is correct |
12 |
Correct |
0 ms |
1136 KB |
Output is correct |
13 |
Correct |
0 ms |
1136 KB |
Output is correct |
14 |
Correct |
0 ms |
1136 KB |
Output is correct |
15 |
Correct |
0 ms |
1136 KB |
Output is correct |
16 |
Correct |
0 ms |
1136 KB |
Output is correct |
17 |
Correct |
0 ms |
1136 KB |
Output is correct |
18 |
Correct |
0 ms |
1136 KB |
Output is correct |
19 |
Correct |
0 ms |
1136 KB |
Output is correct |
20 |
Correct |
0 ms |
1136 KB |
Output is correct |
21 |
Correct |
0 ms |
1136 KB |
Output is correct |
22 |
Correct |
0 ms |
1136 KB |
Output is correct |