/*
\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /
\ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ /
\ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ /
\ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ /
\/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/
/\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\
/ \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \
/ /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \
/ \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \
/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \
\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /
\ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ /
\ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ / \ \/ /
\ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ / \ /\ /
\/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/ \/
/\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\ /\
/ \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \
/ /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \ / /\ \
/ \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \ / \/ \
/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \/ /\ \
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;
template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
const vector<string> board = {"***ABCDE",
"FGHIJKLM",
"NOPQRSTU",
"VWXYZ***"};
const int maxN = 55;
int n, x, y;
bool visited[270];
string s, words[maxN];
int main() {
#ifdef LOCAL
freopen("input.INP", "r", stdin);
#endif // LOCAL
cin.tie(0) -> sync_with_stdio(0);
cout.tie(0);
cin >> n;
fore(i, 0, n)
cin >> words[i];
cin >> s;
x = s.size();
fore(i, 0, n) {
y = words[i].size();
if (x >= y)
continue;
if (words[i].substr(0, x) == s)
visited[words[i][x]] = true;
}
for (const string &line : board) {
for (const char &c : line)
if (visited[c])
cout << c;
else
cout << '*';
cout << '\n';
}
return 0;
}
Compilation message
kartomat.cpp: In function 'int main()':
kartomat.cpp:74:32: warning: array subscript has type 'char' [-Wchar-subscripts]
74 | visited[words[i][x]] = true;
| ^
kartomat.cpp:78:25: warning: array subscript has type 'char' [-Wchar-subscripts]
78 | if (visited[c])
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
328 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
324 KB |
Output is correct |
| 10 |
Correct |
1 ms |
320 KB |
Output is correct |
