QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#880036 | #7970. 三步棋 | lonelywolf# | WA | 1ms | 3584kb | C++20 | 1.0kb | 2025-02-02 20:28:16 | 2025-02-02 20:28:17 |
Judging History
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;
}
}
}
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: 0
Wrong Answer
time: 1ms
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 Far 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 Far...
result:
wrong answer 19th lines differ - expected: 'Away', found: 'Far'