QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#290353 | #7970. 三步棋 | kingsnow_2 | AC ✓ | 0ms | 3780kb | C++14 | 1.9kb | 2023-12-24 21:22:21 | 2023-12-24 21:22:21 |
Judging History
answer
//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define getchar nc
#define sight(c) ('0'<=c&&c<='9')
#define LL long long
#define debug(a) cout<<#a<<" is "<<a<<"\n"
#define dput(a) puts("a")
#define eho(x) for(int i=head[x];i;i=net[i])
#define fi first
#define se second
inline char nc(){
static char buf[1000000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
template <class T>
inline void read(T &x){// unsigned
static char c;
for (c=getchar();!sight(c);c=getchar());
for (x=0;sight(c);c=getchar())x=x*10+c-48;
}
template <class T> void write(T x){if (x<10) {putchar('0'+x); return;} write(x/10); putchar('0'+x%10);}
template <class T> inline void writeln(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar('\n'); }
template <class T> inline void writel(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar(' '); }
using namespace std;
char ch[7][7];
int p[7][7],x[7],y[7],xmax,ymax,xmin,ymin,ans,T;
signed main() {
#ifdef LOCAL
// freopen("test.in", "r", stdin);
// freopen("test.out", "w", stdout);
#endif
scanf("%d",&T);
while (T--) {
for (int i=1;i<=5;i++) scanf("%s",ch[i]+1);
for (int i=1;i<=5;i++) x[i]=y[i]=0;
ans=0;
for (int i=1;i<=5;i++)
for (int j=1;j<=5;j++) {
p[i][j]=(ch[i][j]=='o'?1:0);
if (p[i][j]) x[i]++,y[j]++,ans++;
}
xmax=0,ymax=0;
xmin=5,ymin=5;
for (int i=1;i<=5;i++) xmax=max(xmax,x[i]),ymax=max(ymax,y[i]);
for (int i=1;i<=5;i++) {
if (x[i]) xmin=min(xmin,x[i]);
if (y[i]) ymin=min(ymin,y[i]);
}
if (ans==1) {
printf("Away\n");
}
if (ans==2) {
printf("Far\n");
}
if (ans==3) {
printf("Away\n");
}
if (ans==4) {
if (xmax==4||ymax==4||xmax==2&&ymax==2&&xmin&&xmin==2&&ymin==2) printf("Away\n");
else printf("Far\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3768kb
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: 3780kb
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