QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#801057#7970. 三步棋char_phi#AC ✓1ms3712kbC++14813b2024-12-06 18:03:212024-12-06 18:03:22

Judging History

This is the latest submission verdict.

  • [2024-12-06 18:03:22]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3712kb
  • [2024-12-06 18:03:21]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;

char c[105][105];
int check(){
	for(int i=1;i<=5;i++){
		for(int j=1;j<=5;j++){
			if(c[i][j]=='o'){
				if(c[i][j+1]=='o'&&c[i][j+2]=='o'&&c[i][j+3]=='o'){
					return 1;
				}
				if(c[i+1][j]=='o'&&c[i+2][j]=='o'&&c[i+3][j]=='o'){
					return 1;
				}
				if(c[i+1][j]=='o'&&c[i][j+1]=='o'&&c[i+1][j+1]=='o'){
					return 1;
				}
			}
		}
	}
	return 0;
}
int main(){
	int T;cin>>T;
	while(T--){
		int cnt=0;
		for(int i=1;i<=5;i++){
			for(int j=1;j<=5;j++){
				cin>>c[i][j];
				cnt+=(c[i][j]=='o');
			}
		}
		if(cnt==2){
			cout<<"Far"<<endl;
		}
		else if(cnt==1||cnt==3){
			cout<<"Away"<<endl;
		}
		else{
			if(check()){
				cout<<"Away"<<endl;
			}
			else{
				cout<<"Far"<<endl;
			}
		}
	}
	return 0;
} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3712kb

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: 1ms
memory: 3660kb

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