QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#341902	#7863. Parity Game	goodier	WA	2ms	3920kb	C++17	3.9kb	2024-02-29 22:28:12	2024-02-29 22:28:13

Judging History

你现在查看的是最新测评结果

[2024-02-29 22:28:13]
评测

测评结果：WA
用时：2ms
内存：3920kb

查看

[2024-02-29 22:28:12]
提交

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, 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, len);
                            a[i] = 0;
                            flag = 1;
                            break;
                        }
                    }
                }
                if(!flag)
                {
                    puts("1 *");
                    ffl;
                    Del(1, len);
                }
            }
            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, len);
                        flag = 1;
                        break;
                    }
                }
                if(!flag)
                {
                    puts("1 *");
                    ffl;
                    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;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3728kb

input:

output:

Alice
1 +
1 +

result:

ok The player wins!

Test #2:

score: 0

Accepted

time: 0ms

memory: 3736kb

input:

output:

Alice
1 *
1 *

result:

ok The player wins!

Test #3:

score: 0

Accepted

time: 1ms

memory: 3776kb

input:

output:

Bob
3 +
1 +

result:

ok The player wins!

Test #4:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

output:

Bob
1 +

result:

ok The player wins!

Test #5:

score: 0

Accepted

time: 0ms

memory: 3756kb

input:

output:

Bob
1 *

result:

ok The player wins!

Test #6:

score: 0

Accepted

time: 0ms

memory: 3716kb

input:

output:

Bob
1 +

result:

ok The player wins!

Test #7:

score: 0

Accepted

time: 0ms

memory: 3760kb

input:

2 1
0 1
1

output:

Alice
1 +

result:

ok The player wins!

Test #8:

score: -100

Wrong Answer

time: 2ms

memory: 3920kb

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 +
2 +
2 +
1 +
1 +
1 +
2 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
2 +
2 +
2 +
2 +
2 +
1 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
1 +
1 +
1 +
2 +
2 +
2 +
2 +
2 +
1 +
1 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
1 +
1 +
1 +
2 +
2 +
2 +
1 +
1 +
2 +
1 +
1 +
2 +
2 +
2 +
2 +
...

result:

wrong answer The interactor wins!