# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603940 | inksamurai | Marko (COCI15_marko) | C++17 | 17 ms | 1364 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 _3aFGabX 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(){
_3aFGabX;
vec(string) grid={
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
std::map<char,int> id;
rep(i,sz(grid)){
rep(j,sz(grid[i])){
id[grid[i][j]]=i;
}
}
int n;
cin>>n;
vec(string) dict;
rep(i,n){
string s;
cin>>s;
dict.pb(s);
}
string s;
cin>>s;
int res=0;
rep(i,n){
string now="";
rep(j,sz(dict[i])){
now+=(char)(id[dict[i][j]]+1+'0');
}
res+=(now==s);
}
print(res);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |