# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240824 | SamAnd | Kartomat (COCI17_kartomat) | C++17 | 5 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
char s[4][10] =
{
"***ABCDE",
"FGHIJKLM",
"NOPQRSTU",
"VWXYZ***"
};
bool c[4][10];
int n;
char a[55][102];
char b[102];
void solv()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i)
scanf(" %s", a[i]);
scanf(" %s", b);
for (int i = 0; i < n; ++i)
{
int n = strlen(a[i]);
int m = strlen(b);
if (n <= m)
continue;
bool z = true;
for (int j = 0; j < m; ++j)
{
if (b[j] != a[i][j])
{
z = false;
break;
}
}
if (z)
{
for (int ii = 0; ii < 4; ++ii)
{
for (int jj = 0; jj < 8; ++jj)
{
if (s[ii][jj] == a[i][m])
{
c[ii][jj] = true;
}
}
}
}
}
for (int i = 0; i < 4; ++i)
{
for (int j = 0; j < 8; ++j)
{
if (!c[i][j])
s[i][j] = '*';
}
}
for (int i = 0; i < 4; ++i)
printf("%s\n", s[i]);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |