제출 #245695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245695		Vimmer	Kartomat (COCI17_kartomat)	C++14	80 / 80	5 ms	384 KiB

kartomat

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(998244353)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

bool mk[30];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    string s[n];

    for (int i = 0; i < n; i++) cin >> s[i];

    string t;

    cin >> t;

    for (int i = 0; i < n; i++)
    {
        bool good = 1;

        if (sz(t) > sz(s[i])) continue;

        for (int j = 0; j < sz(t); j++)
        {
            if (s[i][j] == t[j]) continue;

            good = 0;

            break;
        }

        if (!good) continue;

        if (t != s[i]) mk[s[i][sz(t)] - 'A'] = 1;
    }

    int v = -3;

    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 8; j++, v++)
        {
            if (v >= 0 && mk[v]) cout << char(v + 'A');
              else cout << '*';
        }

        cout << endl;
    }
}

• Subtask 1: 80 / 80