QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #341896 | #7863. Parity Game | goodier | WA | 2ms | 3976kb | C++17 | 3.7kb | 2024-02-29 22:23:50 | 2024-02-29 22:23:51 |
Judging History
answer
#include <bits/stdc++.h>
#define ffl fflush(stdout)
using namespace std;
const int N = 550;
int a[N], n, t;
void Del(int x, int n)
{
for(int i = x; i < n; i++)
{
a[i] = a[i + 1];
}
}
int main()
{
scanf("%d%d", &n, &t);
int len = 0, res0 = 0, res1 = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
if(a[i])
{
len++;
}
else
{
res1 += (len + 1) / 2; len = 0;
res0++;
}
}
res1 += (len + 1) / 2; len = 0;
int flag0 = 0;
if(!t)
{
if(res1 <= res0) flag0 = 1;
}
else
{
if(res1 < res0) flag0 = 1;
}
if(flag0)
{
if(!t) puts("Alice");
else puts("Bob");
ffl;
for(int len = n; len >= 2; len--)
{
if(((n - len) & 1) ^ t ^ 1)
{
int flag = 0;
for(int i = 1; i < len; i++)
{
if(a[i] == a[i + 1] && a[i] == 1)
{
printf("%d +\n", i);
ffl;
Del(i + 1, len);
a[i] = 0;
flag = 1;
break;
}
}
if(!flag)
{
for(int i = 1; i <= len; i++)
{
if(a[i] == 1)
{
printf("%d *\n", i - (i == len));
ffl;
Del(i + 1, len);
a[i] = 0;
break;
}
}
}
}
else
{
char str[2]; int x;
scanf("%d%s", &x, str);
if(str[0] == '*')
{
a[x] &= a[x + 1];
}
else if(str[0] == '+')
{
int v = (a[x] + a[x + 1]) & 1;
a[x] = v;
}
Del(x + 1, len);
}
}
}
else
{
if(n & 1) puts("Bob");
else puts("Alice");
ffl;
for(int len = n; len >= 3; len--)
{
if(((n - len) & 1) ^ (n & 1) ^ 1)
{
int flag = 0;
for(int i = 1; i <= len; i++)
{
if(a[i] == 0)
{
printf("%d +\n", i - (i == len));
ffl;
Del(i + 1, len);
flag = 1;
break;
}
}
if(!flag)
{
puts("* 1");
Del(2, len);
}
}
else
{
char str[2]; int x;
//exit(0);
scanf("%d%s", &x, str);
if(str[0] == '*')
{
a[x] &= a[x + 1];
}
else if(str[0] == '+')
{
int v = (a[x] + a[x + 1]) & 1;
a[x] = v;
}
Del(x + 1, len);
}
}
if(a[1] + a[2] == 1)
{
if((n & 1) ^ t) puts("1 +");
else puts("1 *");
ffl;
}
else
{
if((n & 1) ^ t) puts("1 *");
else puts("1 +");
ffl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3932kb
input:
4 1 0 1 0 1 1 * 1
output:
Alice 1 + 1 +
result:
ok The player wins!
Test #2:
score: 0
Accepted
time: 0ms
memory: 3968kb
input:
4 0 1 0 1 0 1 + 1
output:
Alice 1 * 1 *
result:
ok The player wins!
Test #3:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
5 1 1 1 1 0 0 4 + 1 * 1
output:
Bob 3 + 1 +
result:
ok The player wins!
Test #4:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
3 0 1 1 1 1 + 1
output:
Bob 1 +
result:
ok The player wins!
Test #5:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
3 1 1 0 1 1 * 1
output:
Bob 1 *
result:
ok The player wins!
Test #6:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
3 0 1 0 1 1 * 1
output:
Bob 1 +
result:
ok The player wins!
Test #7:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
2 1 0 1 1
output:
Alice 1 +
result:
ok The player wins!
Test #8:
score: -100
Wrong Answer
time: 2ms
memory: 3976kb
input:
499 0 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 0 ...
output:
Bob 1 + 1 + 1 + 1 + 1 + 1 + 2 + 2 + 2 + 3 + 3 + 3 + 3 + 3 + 4 + 4 + 4 + 4 + 4 + 5 + 5 + 5 + 5 + 5 + 5 + 6 + 6 + 6 + 6 + 6 + 6 + 7 + 7 + 7 + 7 + 7 + 7 + 7 + 7 + 7 + 8 + 8 + 8 + 8 + 8 + 8 + 8 + 9 + 9 + 9 + 9 + 10 + 10 + 10 + 10 + 10 + 11 + 11 + 12 + 12 + 12 + 12 + 12 + 12 + 12 + 13 + 13 + 13 + 14 + 14...
result:
wrong answer The interactor wins!