QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#73206 | #2941. Letterle | qdd# | AC ✓ | 2ms | 3484kb | C++20 | 1.1kb | 2023-01-23 05:00:57 | 2023-01-23 05:00:59 |
Judging History
answer
// qdd on Jan 22, 2023
#ifdef qdd
#include <ringo>
#else
#include <bits/stdc++.h>
#define dbg(...)
#define dbgr(x, y)
#endif
using namespace std;
using ll = long long;
#define ALL(x) begin(x), end(x)
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (T& x : v) is >> x;
return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
bool f = 0;
for (const T& x : v) (f ? os << ' ' : os) << x, f = 1;
return os;
}
void sol() {
string s;
cin >> s;
set<char> S;
for (char c : s) S.insert(c);
vector<string> a(7);
cin >> a;
for (int j = 0; j < 7; j++) {
string ans(5, 'X');
for (int i = 0; i < 5; i++) {
if (s[i] == a[j][i])
ans[i] = 'G';
else if (S.count(a[j][i]))
ans[i] = 'Y';
}
if (ans == "GGGGG") {
cout << "WINNER\n";
break;
}
if (j == 6) {
cout << "LOSER" << '\n';
} else {
cout << ans << '\n';
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
sol();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3392kb
input:
LIMIT ABCDE FGHIJ KLMNO PQRST LIMIT LEMET LAMET
output:
XXXXX XXXGX XYGXX XXXXG WINNER
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3360kb
input:
LIMIT ABCDE FGHIJ KLMNO PQRST LAMIT LEMIT LOMIT
output:
XXXXX XXXGX XYGXX XXXXG GXGGG GXGGG LOSER
result:
ok 7 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3376kb
input:
AAAAA ABCDE ABCDA ABABA ABAAA AAAAA AAAAA AAAAA
output:
GXXXX GXXXG GXGXG GXGGG WINNER
result:
ok 5 lines
Test #4:
score: 0
Accepted
time: 2ms
memory: 3404kb
input:
AAAAA ABCDE ABCDA ABABA ABAAA AAAAA AABAA BAAAB
output:
GXXXX GXXXG GXGXG GXGGG WINNER
result:
ok 5 lines
Test #5:
score: 0
Accepted
time: 2ms
memory: 3396kb
input:
AAAAA ABCDE ABCDA ABABA ABAAA AABAA AAAAA BAAAB
output:
GXXXX GXXXG GXGXG GXGGG GGXGG WINNER
result:
ok 6 lines
Test #6:
score: 0
Accepted
time: 2ms
memory: 3376kb
input:
AAAAA ABCDE ABCDA ABABA ABAAA AABAA BAAAB AAAAA
output:
GXXXX GXXXG GXGXG GXGGG GGXGG XGGGX WINNER
result:
ok 7 lines
Test #7:
score: 0
Accepted
time: 2ms
memory: 3400kb
input:
AAAAA AAAAA ABCDE ABCDA ABABA ABAAA AABAA BAAAB
output:
WINNER
result:
ok single line: 'WINNER'
Test #8:
score: 0
Accepted
time: 2ms
memory: 3408kb
input:
TRUMP PMURT TURPM UPMRT TRUMP MPUTR MUPRT TURMP
output:
YYGYY GYYYY YYYYY WINNER
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
TRUMP TRUMP PMURT TURPM UPMRT MPUTR MUPRT TURMP
output:
WINNER
result:
ok single line: 'WINNER'
Test #10:
score: 0
Accepted
time: 2ms
memory: 3480kb
input:
TRUMP PMURT TRUMP TURPM UPMRT MPUTR MUPRT TURMP
output:
YYGYY WINNER
result:
ok 2 lines
Test #11:
score: 0
Accepted
time: 2ms
memory: 3408kb
input:
TRUMP PMURT TURPM UPMRT MPUTR MUPRT TURMP TRUMP
output:
YYGYY GYYYY YYYYY YYGYY YYYYY GYYGG WINNER
result:
ok 7 lines
Test #12:
score: 0
Accepted
time: 0ms
memory: 3372kb
input:
TRUMP PMURT TURPM UPMRT PRUMT MPUTR MUPRT TURMP
output:
YYGYY GYYYY YYYYY YGGGY YYGYY YYYYY LOSER
result:
ok 7 lines