QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#297475	#7863. Parity Game	ucup-team1525^#	WA	2ms	3744kb	C++20	2.5kb	2024-01-04 15:35:47	2024-01-04 15:35:48

Judging History

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

[2024-01-04 15:35:48]
评测

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

查看

[2024-01-04 15:35:47]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=505;
int n,t;
int a[N];
int f(int x)
{
    int p=0,len=0;
    for (int i=1;i<=x;++i)
    {
        if (a[i]==0)
        {
            p+=len%2;
            len=0;
            --p;
        }
        else
            ++len;
    }
    return p+len%2;
}
char s[10];



void mv(int x)
{
    for (int i=x;i<n;++i)
        a[i]=a[i+1];
}
void moni()
{
    int p;
    scanf("%d%s",&p,s);
    if (s[0]=='+')
        a[p]^=a[p+1];
    else
        a[p]&=a[p+1];
    mv(p+1);
}

void inc(int x)
{
    for (int i=1;i<x;++i)
        if ((a[i]|a[i+1])==0)
        {
            cout<<i<<' '<<'+'<<endl;
            a[i]^=a[i+1];
            mv(i+1);
            return;
        }
    for (int i=1;i<x;++i)
        if (a[i]!=a[i+1])
        {
            cout<<i<<' '<<'+'<<endl;
            a[i]^=a[i+1];
            mv(i+1);
            return;
        }
    cout<<"1 *"<<endl;
    a[1]&=a[2];
    mv(2);
}
void dec(int x)
{
    for (int i=1;i<x;++i)
        if (a[i]&a[i+1])
        {
            cout<<i<<' '<<'+'<<endl;
            a[i]^=a[i+1];
            mv(i+1);
            return;
        }
    for (int i=1;i<x;++i)
        if (a[i]!=a[i+1])
        {
            cout<<i<<' '<<'*'<<endl;
            a[i]&=a[i+1];
            mv(i+1);
            return;
        }
    cout<<"1 *"<<endl;
    a[1]&=a[2];
    mv(2);
}
void workA(int d)
{
    cout<<"Alice"<<endl;
    for (int i=1;i<n;++i)
        if (i%2==1)
        {
            if (d)
                inc(n-i+1);
            else
                dec(n-i+1);
        }
        else
        {
            moni();
        }
}
void workB(int d)
{
    cout<<"Bob"<<endl;
    for (int i=1;i<n;++i)
        if (i%2==0)
        {
            if (d)
                inc(n-i+1);
            else
                dec(n-i+1);
        }
        else
        {
            moni();
        }
}

int main()
{
    scanf("%d%d",&n,&t);
    for (int i=1;i<=n;++i)
    {
        scanf("%d",&a[i]);
        // a[i]%=2;
    }
    int p=f(n);
    if (n%2==0)
    {
        if (t==0)
        {
            workA(0);
        }
        else
        {
            if (p>=0)
                workA(1);
            else
                workB(0);
        }
    }
    else
    {
        if (t==0)
        {
            if (p>0)
                workB(1);
            else
                workA(0);
        }
        else
            workB(0);
    }
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3492kb

input:

output:

Alice
1 +
1 +

result:

ok The player wins!

Test #2:

score: 0

Accepted

time: 0ms

memory: 3520kb

input:

output:

Alice
1 *
1 *

result:

ok The player wins!

Test #3:

score: 0

Accepted

time: 0ms

memory: 3736kb

input:

output:

Bob
1 +
1 *

result:

ok The player wins!

Test #4:

score: 0

Accepted

time: 0ms

memory: 3524kb

input:

output:

Bob
1 +

result:

ok The player wins!

Test #5:

score: 0

Accepted

time: 0ms

memory: 3740kb

input:

output:

Bob
1 *

result:

ok The player wins!

Test #6:

score: 0

Accepted

time: 0ms

memory: 3696kb

input:

output:

Bob
1 +

result:

ok The player wins!

Test #7:

score: 0

Accepted

time: 0ms

memory: 3740kb

input:

2 1
0 1
1

output:

Alice
1 +

result:

ok The player wins!

Test #8:

score: 0

Accepted

time: 0ms

memory: 3744kb

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:

Alice
2 +
2 +
2 +
4 +
6 +
10 +
12 +
12 +
14 +
14 +
16 +
20 +
20 +
20 +
20 +
22 +
22 +
24 +
24 +
26 +
26 +
26 +
28 +
28 +
28 +
28 +
30 +
30 +
30 +
32 +
32 +
34 +
36 +
38 +
40 +
40 +
48 +
48 +
48 +
48 +
48 +
52 +
54 +
54 +
54 +
58 +
58 +
58 +
60 +
60 +
62 +
66 +
68 +
70 +
70 +
72 +
74 +
76 +
76 +
78 +...

result:

ok The player wins!

Test #9:

score: 0

Accepted

time: 0ms

memory: 3552kb

input:

499 0
1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 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 0 1 ...

output:

Bob
1 +
2 +
2 +
2 +
4 +
6 +
6 +
8 +
10 +
12 +
12 +
14 +
14 +
18 +
18 +
18 +
18 +
18 +
20 +
22 +
24 +
24 +
24 +
26 +
26 +
30 +
32 +
34 +
34 +
34 +
34 +
36 +
38 +
44 +
46 +
48 +
48 +
50 +
50 +
52 +
52 +
54 +
58 +
60 +
60 +
62 +
64 +
64 +
66 +
66 +
70 +
70 +
72 +
74 +
76 +
76 +
78 +
78 +
84 +
86 +
86 +...

result:

ok The player wins!

Test #10:

score: 0

Accepted

time: 0ms

memory: 3564kb

input:

500 0
0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 ...

output:

Alice
2 +
4 +
4 +
6 +
6 +
6 +
10 +
10 +
12 +
12 +
14 +
16 +
16 +
18 +
18 +
20 +
22 +
22 +
24 +
24 +
24 +
24 +
26 +
28 +
30 +
34 +
34 +
36 +
40 +
40 +
42 +
42 +
50 +
50 +
50 +
52 +
54 +
54 +
54 +
56 +
56 +
58 +
58 +
60 +
60 +
60 +
60 +
64 +
66 +
66 +
66 +
66 +
74 +
74 +
78 +
78 +
80 +
82 +
84 +
86 +
...

result:

ok The player wins!

Test #11:

score: 0

Accepted

time: 1ms

memory: 3744kb

input:

499 1
0 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 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 0 1 1 1 1 1 1 1 0 1 1 1 0 1 0 1 0 ...

output:

Bob
1 +
1 +
1 +
9 +
13 +
13 +
15 +
19 +
19 +
21 +
25 +
25 +
25 +
27 +
29 +
29 +
31 +
31 +
31 +
31 +
33 +
33 +
39 +
39 +
39 +
39 +
39 +
43 +
43 +
43 +
45 +
45 +
47 +
47 +
49 +
49 +
49 +
51 +
51 +
53 +
53 +
53 +
55 +
61 +
61 +
63 +
63 +
63 +
65 +
65 +
67 +
67 +
69 +
71 +
71 +
71 +
75 +
75 +
79 +
79 +
...

result:

ok The player wins!

Test #12:

score: 0

Accepted

time: 0ms

memory: 3504kb

input:

499 1
1 0 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 1 ...

output:

Bob
4 +
4 +
6 +
8 +
8 +
12 +
14 +
14 +
16 +
18 +
20 +
24 +
24 +
24 +
24 +
24 +
26 +
28 +
30 +
30 +
30 +
30 +
30 +
34 +
36 +
38 +
40 +
42 +
44 +
44 +
44 +
44 +
46 +
46 +
50 +
50 +
52 +
52 +
56 +
56 +
60 +
60 +
60 +
62 +
62 +
64 +
64 +
64 +
66 +
68 +
68 +
68 +
70 +
72 +
72 +
74 +
74 +
76 +
76 +
76 +
7...

result:

ok The player wins!

Test #13:

score: 0

Accepted

time: 2ms

memory: 3688kb

input:

500 1
0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 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 1 1 1 1 0 1 1 1 1 1 1 1 0 1 0 1 0 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 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 ...

output:

Alice
1 +
1 +
1 +
2 +
2 +
2 +
2 +
2 +
4 +
4 +
6 +
12 +
12 +
14 +
14 +
14 +
16 +
16 +
16 +
20 +
22 +
22 +
24 +
24 +
26 +
26 +
26 +
28 +
28 +
28 +
34 +
36 +
36 +
36 +
38 +
38 +
40 +
42 +
42 +
44 +
46 +
46 +
46 +
46 +
50 +
52 +
52 +
58 +
58 +
60 +
62 +
64 +
66 +
72 +
72 +
74 +
74 +
74 +
76 +
78 +
78 +
...

result:

ok The player wins!

Test #14:

score: 0

Accepted

time: 2ms

memory: 3496kb

input:

500 0
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...

output:

Alice
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 ...

result:

ok The player wins!

Test #15:

score: 0

Accepted

time: 2ms

memory: 3512kb

input:

499 0
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...

output:

Alice
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 ...

result:

ok The player wins!

Test #16:

score: 0

Accepted

time: 1ms

memory: 3736kb

input:

499 0
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...

output:

Bob
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
...

result:

ok The player wins!

Test #17:

score: 0

Accepted

time: 0ms

memory: 3500kb

input:

500 1
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...

output:

Alice
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 ...

result:

ok The player wins!

Test #18:

score: 0

Accepted

time: 1ms

memory: 3520kb

input:

499 1
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...

output:

Bob
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
...

result:

ok The player wins!

Test #19:

score: 0

Accepted

time: 2ms

memory: 3736kb

input:

499 1
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...

output:

Bob
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
...

result:

ok The player wins!

Test #20:

score: 0

Accepted

time: 2ms

memory: 3728kb

input:

500 0
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...

output:

Alice
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 *
1 ...

result:

ok The player wins!

Test #21:

score: -100

Wrong Answer

time: 0ms

memory: 3736kb

input:

500 1
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...

output:

Alice
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 +
1 ...

result:

wrong answer The interactor wins!