QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#880040#7970. 三步棋lonelywolf#AC ✓0ms3712kbC++201.3kb2025-02-02 20:31:452025-02-02 20:31:46

Judging History

This is the latest submission verdict.

  • [2025-02-02 20:31:46]
  • Judged
  • Verdict: AC
  • Time: 0ms
  • Memory: 3712kb
  • [2025-02-02 20:31:45]
  • Submitted

answer

#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve() {
	int cnt = 0;
	vector<string> v(5);
	for (int i = 0; i < 5; i++) {
		cin >> v[i];
		for (int j = 0; j < 5; j++) {
			if (v[i][j] == 'o') {
				cnt++;
			}
		}
	}
	if (cnt == 1 || cnt == 3) {
		cout << "Away\n";
	} else if (cnt == 2) {
		cout << "Far\n";
	} else {
		for (int i = 0; i < 5; i++) {
			for (int j = 0; j < 2; j++) {
				bool ok = true;
				for (int k = 0; k < 4; k++) {
					if (v[i][j + k] != 'o') {
						ok = false;
					}
				}
				if (ok) {
					cout << "Away\n";
					return;
				}
			}
		}
		for (int j = 0; j < 5; j++) {
			for (int i = 0; i < 2; i++) {
				bool ok = true;
				for (int k = 0; k < 4; k++) {
					if (v[i + k][j] != 'o') {
						ok = false;
					}
				}
				if (ok) {
					cout << "Away\n";
					return;
				}
			}
		}

		for (int i = 0; i < 4; i++) {
			for (int j = 0; j < 4; j++) {
				if (v[i][j] == 'o' && v[i + 1][j] == 'o' && v[i][j + 1] == 'o' && v[i + 1][j + 1] == 'o') {
					cout << "Away\n";
					return;
				}
			}
		}
		cout << "Far\n";
	}
}

signed 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: 3584kb

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

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