Submission #64946

#TimeUsernameProblemLanguageResultExecution timeMemory
64946forestryksKarte (COCI15_karte)C++14
50 / 50
3 ms1068 KiB
/////////////////////////////////////////////////////////////////////////////////////////////// #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); } //////////////////////////////////////////////////////////////////////////////////////////////// set<int> a[4]; int id[256]; int main() { FAST_IO; id['P'] = 0; id['K'] = 1; id['H'] = 2; id['T'] = 3; int cnt = 0; char ch; while (cin >> ch) { cnt++; char x, y; cin >> x >> y; int t = x * 10 + y; a[id[ch]].insert(t); } int sz = 0; rep(i, 4) { sz += a[i].size(); } if (sz != cnt) { cout << "GRESKA" << endl; return 0; } else { rep(i, 4) { cout << (13 - a[i].size()) << ' '; } cout << endl; } }

Compilation message (stderr)

karte.cpp: In function 'int main()':
karte.cpp:55:16: warning: array subscript has type 'char' [-Wchar-subscripts]
         a[id[ch]].insert(t);
                ^
#Verdict Execution timeMemoryGrader output
Fetching results...