# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
182402 | awlintqaa | Kartomat (COCI17_kartomat) | C++14 | 2 ms | 376 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.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n;
string ret,s[59];
string ans[9];
int yes[29];
int check(string x){
if(x.size()<=ret.size())return 0;
for(int i=0;i<ret.size();i++){
if(x[i]!=ret[i])return 0;
}
return 1;
}
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>s[i];
ans[0]="***ABCDE";
ans[1]="FGHIJKLM";
ans[2]="NOPQRSTU";
ans[3]="VWXYZ***";
cin>>ret;
vector<string>v;
for(int i=0;i<n;i++){
if(check(s[i]))v.pb(s[i]);
}
for(auto u: v){
yes[u[ret.size()]-'A']=1;
}
set<int>st;
for(int i=0;i<26;i++){
if(!yes[i])st.ins(i);
}
for(int i=0;i<4;i++){
for(int j=0;j<8;j++){
if(ans[i][j]=='*'){
cout<<ans[i][j];
C;
}
if(st.find(ans[i][j]-'A')==st.end())cout<<ans[i][j];
else cout<<'*';
}
cout<<endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |