Submission #696298

#	Time	Username	Problem	Language	Result	Execution time	Memory
696298		bachhoangxuan	Kartomat (COCI17_kartomat)	C++17	80 / 80	1 ms	332 KiB

kartomat

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
string ss[55];
int c[35];
void solve(){
    int n;cin >> n;
    for(int i=0;i<n;i++) cin >> ss[i];
    string s;cin >> s;
    for(int i=0;i<n;i++){
        if((int)s.length()>=(int)ss[i].length()) continue;
        bool ok=true;
        for(int j=0;j<(int)s.length();j++){
            if(s[j]!=ss[i][j]) ok=false;
        }
        if(ok) c[ss[i][(int)s.length()]-'A']=1;
    }
    for(int i=0;i<4;i++){
        for(int j=0;j<8;j++){
            int x=i*8+j-3;
            if(x>=0 && x<26 && c[x]) cout << char('A'+x);
            else cout << '*';
        }
        cout << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• Subtask 1: 80 / 80