| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 28348 | 볼빨간 승관이 (#68) | Bulb Game (FXCUP2_bulb) | C++11 | 0 ms | 1128 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstring>
bool haha[1005];
int Num;
void Init(int N)
{
memset(haha, 0, sizeof(haha));
Num = N;
}
int MakeTurn(int M)
{
int tcnt = 0, fcnt = 0, maxidx = 0, maxv = -987654321;
for(int i = M; i < Num; ++i) {
if(haha[i])
tcnt++;
else
fcnt++;
if(maxv < fcnt - tcnt) {
maxv = fcnt - tcnt;
maxidx = i;
}
}
for(int i = M; i <= maxidx; ++i)
haha[i] = !haha[i];
return maxidx + 1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||