Submission #1872557
Source Code Expand
#include <iostream> #include <array> #include <map> #include <algorithm> #include <cmath> #include <vector> #include <fstream> #include <string> #include <random> #include <queue> #include <iomanip> #include <functional> #include <climits> #define FOR(x,n) for(int x = 0; x < n; x++) using namespace std; using ll = long long int; using pii = pair<int, int>; using pll = pair<ll, ll>; using vll = std::vector<ll>; using vpll = std::vector<pll>; using vpii = std::vector<pii>; using vi = std::vector<int>; using vvi = std::vector<vi>; using vvpii = std::vector<vpii>; using vch = std::vector<char>; using vvch = std::vector<vch>; const ll mod197 = 1000000007LL; const ll INF = 200LL * 200 * 100000 + 10; const double PI11 = 3.14159265359; int main(void) { int n, c[4] = {}; cin >> n; FOR(i, n) { char t; cin >> t; c[t - '1']++; } cout << *max_element(c, c + 4) << " " << * min_element(c,c+4) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - センター採点 |
User | nasatame |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 986 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 1 ms | 256 KB |
00_sample2.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 1 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
01_rnd_16.txt | AC | 1 ms | 256 KB |
01_rnd_17.txt | AC | 1 ms | 256 KB |
01_rnd_18.txt | AC | 1 ms | 256 KB |
01_rnd_19.txt | AC | 1 ms | 256 KB |
02_all_1.txt | AC | 1 ms | 256 KB |
02_all_2.txt | AC | 1 ms | 256 KB |
02_all_3.txt | AC | 1 ms | 256 KB |
02_all_4.txt | AC | 1 ms | 256 KB |
03_mini_1.txt | AC | 1 ms | 256 KB |
03_mini_2.txt | AC | 1 ms | 256 KB |
03_mini_3.txt | AC | 1 ms | 256 KB |
03_mini_4.txt | AC | 1 ms | 256 KB |