# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101211 | bvv23 | Karte (COCI15_karte) | C++17 | 1 ms | 508 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);
}
};
void failure()
{
string s;
cin >> s;
map <char,int> mp;
vector <set<int>> card(4);
mp['P'] = 0;
mp['K'] = 1;
mp['H'] = 2;
mp['T'] = 3;
// card[herf] = ededi
for (int i = 0; i < s.size(); i += 3) {
int eded = (s[i + 1] - '0') * 10 + (s[i + 2] - '0');
if (card[mp[s[i]]].count(eded)) {
drop("GRESKA");
}
card[mp[s[i]]].insert(eded);
}
for (int i = 0; i < 4; i++) {
cout << 13 - card[i].size() << " ";
}
}
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... |