# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
165405 |
2019-11-27T06:15:46 Z |
Atill83 |
Marko (COCI15_marko) |
C++14 |
|
163 ms |
1116 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
map<string, int> mp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("../IO/int.txt","r",stdin);
freopen("../IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 0; i < n; i++){
string s;
cin>>s;
string l;
for(int j = 0; j < (int) s.length(); j++){
int cur = (int)(s[j] - 'a');
if(cur >= 15 && cur <= 18){
l = l + '7';
}else if(cur >= 19 && cur <= 21){
l = l + '8';
}else if(cur >= 22){
l = l + '9';
}else{
int wic = cur/3 + 2;
l = l + ((char) ('0' + wic));
}
}
//cout<<l<<endl;
mp[l]++;
}
string t;
cin>>t;
cout<<mp[t]<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
152 ms |
1104 KB |
Output is correct |
5 |
Correct |
21 ms |
632 KB |
Output is correct |
6 |
Correct |
22 ms |
504 KB |
Output is correct |
7 |
Correct |
81 ms |
964 KB |
Output is correct |
8 |
Correct |
163 ms |
1116 KB |
Output is correct |
9 |
Correct |
23 ms |
504 KB |
Output is correct |
10 |
Correct |
114 ms |
892 KB |
Output is correct |