# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101804 | bvv23 | Marko (COCI15_marko) | C++17 | 5 ms | 1616 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.
// Ahmadov orz
/// successful failure
#include <bits/stdc++.h>
/// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
/// using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define drop(x) cout<<x<<endl;return
// template <class T>
// using isTree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/// sometimes you gotta think simple
struct custom_hash {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
string ch[27] = {
"2", "2", "2 ",
"3", "3", "3",
"4", "4", "4",
"5", "5", "5",
"6", "6", "6",
"7", "7", "7", "7",
"8", "8", "8",
"9", "9", "9", "9"
};
string convert(string s)
{
string ans = "";
for (int i = 0; i < s.size(); i++) {
//char c = s[i];
//cout << c << endl;
ans += ch[s[i] - 'a'];
}
return ans;
}
void failure()
{
int n;
cin >> n;
unordered_map <string,int> mp;
vector <string> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
string tmp = convert(arr[i]);
mp[tmp]++;
}
string s;
cin >> s;
int ans = 0;
drop(mp[s]);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int tt = 1;
//cin >> tt;
while (tt--)
{
failure();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |