QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#848063#7970. 三步棋Woxuany1#AC ✓0ms3756kbC++231.2kb2025-01-08 15:07:572025-01-08 15:07:57

Judging History

This is the latest submission verdict.

  • [2025-01-08 15:07:57]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3756kb
  • [2025-01-08 15:07:57]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PII;

void solve()
{
    char mp[5][5];
    int cnt = 0;
    for (int i = 0; i < 5; i ++ )
        for (int j = 0; j < 5; j ++ )
            cin >> mp[i][j], cnt += mp[i][j] == 'o';
    if (cnt == 1) puts("Away");
    else if (cnt == 2) puts("Far");
    else if (cnt == 3) puts("Away");
    else
    {
        for (int i = 0; i < 5; i ++ )
        {
            int tot = 0;
            for (int j = 0; j < 5; j ++ ) tot += mp[i][j] == 'o';
            if (tot == 4) return puts("Away"), void();
        }
        for (int j = 0; j < 5; j ++ )
        {
            int tot = 0;
            for (int i = 0; i < 5; i ++ ) tot += mp[i][j] == 'o';
            if (tot == 4) return puts("Away"), void();
        }
        for (int i = 0; i < 4; i ++ )
            for (int j = 0; j < 4; j ++ )
                if (mp[i][j] == 'o' && mp[i][j + 1] == 'o' && mp[i + 1][j] == 'o' && mp[i + 1][j + 1] == 'o')
                    return puts("Away"), void();
        puts("Far");
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T -- ) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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