Submission #64359445
Source Code Expand
Copy
#include <bits/stdc++.h>#ifdef LOCAL#include <debug.hpp>#else#define debug(...) void(0)#endiftemplate <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }template <class T> void mkuni(std::vector<T>& v) {std::ranges::sort(v);auto result = std::ranges::unique(v);v.erase(result.begin(), result.end());}template <class T> int lwb(const std::vector<T>& v, const T& x) {return std::distance(v.begin(), std::ranges::lower_bound(v, x));}
#include <bits/stdc++.h> #ifdef LOCAL #include <debug.hpp> #else #define debug(...) void(0) #endif template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); } template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); } template <class T> void mkuni(std::vector<T>& v) { std::ranges::sort(v); auto result = std::ranges::unique(v); v.erase(result.begin(), result.end()); } template <class T> int lwb(const std::vector<T>& v, const T& x) { return std::distance(v.begin(), std::ranges::lower_bound(v, x)); } using namespace std; using ll = long long; void solve() { int N; string S; cin >> N >> S; map<char, int> mp; for (char c : S) { mp[c]++; } int ans = 0; for (auto [key, val] : mp) { if (key == 'A' or key == 'P') { chmax(ans, (val + 1) / 2); } else if (key == 'K' or key == 'E' or key == 'N' or key == 'C' or key == 'M') { chmax(ans, val); } else { cout << -1 << "\n"; return; } } cout << ans << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Pakencamp |
User | rniya |
Language | C++ 23 (gcc 12.2) |
Score | 100 |
Code Size | 1295 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 3748 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 02_handmade_00.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt, 02_handmade_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3460 KB |
00_sample_01.txt | AC | 1 ms | 3444 KB |
00_sample_02.txt | AC | 1 ms | 3524 KB |
01_random_00.txt | AC | 1 ms | 3508 KB |
01_random_01.txt | AC | 2 ms | 3588 KB |
01_random_02.txt | AC | 2 ms | 3748 KB |
01_random_03.txt | AC | 2 ms | 3648 KB |
01_random_04.txt | AC | 2 ms | 3648 KB |
01_random_05.txt | AC | 3 ms | 3580 KB |
01_random_06.txt | AC | 2 ms | 3652 KB |
01_random_07.txt | AC | 2 ms | 3620 KB |
01_random_08.txt | AC | 1 ms | 3560 KB |
01_random_09.txt | AC | 2 ms | 3520 KB |
02_handmade_00.txt | AC | 1 ms | 3572 KB |
02_handmade_01.txt | AC | 1 ms | 3656 KB |
02_handmade_02.txt | AC | 1 ms | 3652 KB |
02_handmade_03.txt | AC | 1 ms | 3528 KB |
02_handmade_04.txt | AC | 1 ms | 3396 KB |