# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631238 | inksamurai | Kartomat (COCI17_kartomat) | C++17 | 1 ms | 340 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 rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3phCa4T ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3phCa4T;
int n;
cin>>n;
vec(string) a;
rep(i,n){
string s;
cin>>s;
a.pb(s);
}
vec(string) tbl={
"***ABCDE",
"FGHIJKLM",
"NOPQRSTU",
"VWXYZ***"
};
string need;
cin>>need;
std::map<char,int> mp;
rep(i,n){
string s=a[i];
if(sz(s)>sz(need) and s.substr(0,sz(need))==need){
mp[s[sz(need)]]=1;
}
}
for(auto s:tbl){
for(auto ch:s){
if(mp[ch]){
cout<<ch;
}else{
cout<<"*";
}
}
print();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |