QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#851358 | #7970. 三步棋 | JZYZ# | AC ✓ | 0ms | 3852kb | C++14 | 1.2kb | 2025-01-10 18:09:12 | 2025-01-10 18:09:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t;
char a[10][10];
int main()
{
scanf("%d",&t);
while(t--)
{
int num=0;
for(int i=1;i<=5;i++)
{
scanf("%s",a[i]+1);
for(int j=1;j<=5;j++)
if(a[i][j]=='o')
num++;
}
if(num==2)
puts("Far");
else if(num==1||num==3)
puts("Away");
else
{
bool flag=0;
for(int i=1;i<=5;i++)
{
for(int j=1;j<=2;j++)
{
bool pd=0;
for(int k=j;k<=j+3;k++)
{
if(a[i][k]!='o')
{
pd=1;
break;
}
}
if(!pd)
{
flag=1;
break;
}
}
if(flag)
break;
}
for(int i=1;i<=5;i++)
{
for(int j=1;j<=2;j++)
{
bool pd=0;
for(int k=j;k<=j+3;k++)
{
if(a[k][i]!='o')
{
pd=1;
break;
}
}
if(!pd)
{
flag=1;
break;
}
}
if(flag)
break;
}
for(int i=1;i<=4;i++)
{
for(int j=1;j<=4;j++)
{
if(a[i][j]=='o'&&a[i][j+1]=='o'&&a[i+1][j]=='o'&&a[i+1][j+1]=='o')
{
flag=1;
break;
}
}
if(flag)
break;
}
if(flag)
puts("Away");
else
puts("Far");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3852kb
input:
200 ..... ..oo. ..... ..... ..... ..... ..... oo... o.... ..... ..... .o... oo... ..... ..... ..... ..... o.... oo... ..... ..... ...o. ..oo. ..... ..... ..... ....o ..... ..... ..... ..... ..... ..... .ooo. .o... ..... ..... ..... ..... ...oo .o... .o... .o... ..... ..... ..... ..... ..oo. ..... .....
output:
Far Away Away Away Away Away Far Far Away Far Away Far Far Away Far Away Far Away Away Away Far Away Far Away Away Away Away Far Far Far Far Away Far Away Far Away Far Away Away Far Away Away Far Far Away Far Far Away Far Away Away Away Away Away Away Far Away Far Away Away Away Away Far Away Far Fa...
result:
ok 200 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
200 ...oo ..oo. ..... ..... ..... ..... ..ooo ....o ..... ..... ..... o.... oo... .o... ..... ..... .ooo. ...o. ..... ..... ..... .oo.. ..oo. ..... ..... ..... ...o. ...o. ...o. ...o. ..... .oo.. ..o.. ..o.. ..... ..o.. ..ooo ..... ..... ..... ..... .oooo ..... ..... ..... ..... ..... o.... oo... o....
output:
Far Far Far Far Far Away Far Far Away Far Far Far Far Away Far Far Far Far Far Far Far Far Far Far Far Away Far Far Far Far Away Far Away Far Far Far Away Far Far Far Far Far Far Far Far Away Far Far Far Far Far Far Away Far Away Far Far Far Away Away Far Far Far Far Away Far Far Far Far Far Far Far...
result:
ok 200 lines