QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#307661#7970. 三步棋ATM12345#AC ✓0ms3716kbC++141.1kb2024-01-19 00:34:112024-01-19 00:34:12

Judging History

This is the latest submission verdict.

  • [2024-01-19 00:34:12]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3716kb
  • [2024-01-19 00:34:11]
  • Submitted

answer

#include <bits/stdc++.h>
#define ll long long
#define LL long long
#define ls p<<1
#define rs p<<1|1
#define Ma 1000005
#define mod 1000000007
#define PLL pair<ll,ll>
#define PDD pair<double,double>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first
#define se second
#define N 61
#define pb push_back
#define ld long double
#define all(x) x.begin(),x.end()
#define inf 1e18

using namespace std;
ll n=5,m,k;
string s[5];

void sol()
{
	for (ll i=0;i<n;i++)
		cin>>s[i];
	ll cnt=0;
	for (ll i=0;i<n;i++)
		for (ll j=0;j<n;j++)
			cnt+=(s[i][j]=='o');
	if (cnt==1||cnt==3)
		printf("Away\n");
	else if (cnt==2)
		printf("Far\n");
	else
	{
		ll mii=n,mai=0,mij=n,maj=0;
		for (ll i=0;i<n;i++)
			for (ll j=0;j<n;j++)
			{
				if (s[i][j]=='o')
					mii=min(mii,i),mai=max(mai,i),mij=min(mij,j),maj=max(maj,j);
			}
		if (mai-mii<=2&&maj-mij<=2&&mai-mii+maj-mij==3)
			printf("Far\n");
		else
			printf("Away\n");
	}
	
	return;
}

int main()
{
	IOS
	ll tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3692kb

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: 3716kb

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