Submission #1519072
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <string> #include <vector> #include <complex> #include <cstdlib> #include <cstring> #include <numeric> #include <utility> #include <iostream> #include <algorithm> #include <functional> #include <unordered_map> #include <unordered_set> using namespace std; #define ll long long #define ull unsigned long long #define INF (1 << 29) #define LLINF (1LL << 61) #define MOD7 1000000007 #define MOD9 1000000009 #define eps 1e-9 #define P pair<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define pul pair<ull, ull> #define all(a) (a).begin(), (a).end() #define FOR(i,a,b) for (int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);--i) #define REP(i,n) for (int i=0;i<(n);++i) #define RREP(i,n) for (int i=(n)-1;i>=0;--i) void YES() { cout << "YES" << endl; } void NO() { cout << "NO" << endl; } void Yes() { cout << "Yes" << endl; } void No() { cout << "No" << endl; } void yes() { cout << "yes" << endl; } void no() { cout << "no" << endl; } int main() { int n; string s; cin >> n >> s; int maxv = 0, minv = INF; for (int i = 0; i < 4; ++i) { int cnt = count(all(s), '1' + i); maxv = max(maxv, cnt); minv = min(minv, cnt); } cout << maxv << endl << minv << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - センター採点 |
User | temple |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1421 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_all_1.txt, 02_all_2.txt, 02_all_3.txt, 02_all_4.txt, 03_mini_1.txt, 03_mini_2.txt, 03_mini_3.txt, 03_mini_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample1.txt | WA | 1 ms | 256 KB |
00_sample2.txt | WA | 1 ms | 256 KB |
01_rnd_00.txt | WA | 1 ms | 256 KB |
01_rnd_01.txt | WA | 1 ms | 256 KB |
01_rnd_02.txt | WA | 1 ms | 256 KB |
01_rnd_03.txt | WA | 1 ms | 256 KB |
01_rnd_04.txt | WA | 1 ms | 256 KB |
01_rnd_05.txt | WA | 1 ms | 256 KB |
01_rnd_06.txt | WA | 1 ms | 256 KB |
01_rnd_07.txt | WA | 1 ms | 256 KB |
01_rnd_08.txt | WA | 1 ms | 256 KB |
01_rnd_09.txt | WA | 1 ms | 256 KB |
01_rnd_10.txt | WA | 1 ms | 256 KB |
01_rnd_11.txt | WA | 1 ms | 256 KB |
01_rnd_12.txt | WA | 1 ms | 256 KB |
01_rnd_13.txt | WA | 1 ms | 256 KB |
01_rnd_14.txt | WA | 1 ms | 256 KB |
01_rnd_15.txt | WA | 1 ms | 256 KB |
01_rnd_16.txt | WA | 1 ms | 256 KB |
01_rnd_17.txt | WA | 1 ms | 256 KB |
01_rnd_18.txt | WA | 1 ms | 256 KB |
01_rnd_19.txt | WA | 1 ms | 256 KB |
02_all_1.txt | WA | 1 ms | 256 KB |
02_all_2.txt | WA | 1 ms | 256 KB |
02_all_3.txt | WA | 1 ms | 256 KB |
02_all_4.txt | WA | 1 ms | 256 KB |
03_mini_1.txt | WA | 1 ms | 256 KB |
03_mini_2.txt | WA | 1 ms | 256 KB |
03_mini_3.txt | WA | 1 ms | 256 KB |
03_mini_4.txt | WA | 1 ms | 256 KB |