///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////
string key[] = {"", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int id[256];
int n;
map<string, int> cnt;
int main() {
FAST_IO;
for (int i = 0; i < 9; ++i) {
for (int j = 0; j < key[i].size(); ++j) {
id[key[i][j]] = '1' + i;
}
}
cin >> n;
rep(i, n) {
string s;
cin >> s;
for (auto &it : s) {
it = id[it];
}
cnt[s]++;
}
string s;
cin >> s;
cout << cnt[s] << endl;
}
Compilation message
marko.cpp: In function 'int main()':
marko.cpp:46:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0; j < key[i].size(); ++j) {
~~^~~~~~~~~~~~~~~
marko.cpp:47:25: warning: array subscript has type 'char' [-Wchar-subscripts]
id[key[i][j]] = '1' + i;
^
marko.cpp:57:23: warning: array subscript has type 'char' [-Wchar-subscripts]
it = id[it];
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
248 KB |
Output is correct |
2 |
Correct |
3 ms |
360 KB |
Output is correct |
3 |
Correct |
3 ms |
472 KB |
Output is correct |
4 |
Correct |
6 ms |
1480 KB |
Output is correct |
5 |
Correct |
3 ms |
1480 KB |
Output is correct |
6 |
Correct |
2 ms |
1480 KB |
Output is correct |
7 |
Correct |
5 ms |
1940 KB |
Output is correct |
8 |
Correct |
5 ms |
2452 KB |
Output is correct |
9 |
Correct |
4 ms |
2452 KB |
Output is correct |
10 |
Correct |
6 ms |
2804 KB |
Output is correct |