#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
ll n;
string s;
set<string> e;
vector<char> m[20];
int main() {
speed;
precision;
// code
m[2] = {'a', 'b', 'c'};
m[3] = {'d', 'e', 'f'};
m[4] = {'g', 'h', 'i'};
m[5] = {'j', 'k', 'l'};
m[6] = {'m', 'n', 'o'};
m[7] = {'p', 'q', 'r', 's'};
m[8] = {'t', 'u', 'v'};
m[9] = {'w', 'x', 'y', 'z'};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
e.insert(s);
}
cin >> s;
for (int i = 0; i < sz(s); i++) {
vector<string> del;
for (auto x : e)
if (!binary_search(all(m[s[i] - '0']), x[i])) del.pb(x);
for (auto x : del) e.erase(x);
}
cout << sz(e);
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
Compilation message
marko.cpp: In function 'void ioi(std::string)':
marko.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
26 | freopen((name + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
marko.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
27 | freopen((name + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
38 ms |
1612 KB |
Output is correct |
5 |
Correct |
3 ms |
460 KB |
Output is correct |
6 |
Correct |
5 ms |
460 KB |
Output is correct |
7 |
Correct |
7 ms |
1212 KB |
Output is correct |
8 |
Correct |
43 ms |
1612 KB |
Output is correct |
9 |
Correct |
7 ms |
460 KB |
Output is correct |
10 |
Correct |
32 ms |
1228 KB |
Output is correct |