Submission #4156
Source Code Expand
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#include <fstream>
#include <cassert>
#include <numeric>
#include <iomanip>
using namespace std;
const bool OJ =
#ifdef ONLINE_JUDGE
true
#else
false
#endif
;
#define int ll
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb push_back
#define eb emplace_back
#define SZ(a) ((int)((a).size()))
#define rep(i,n) for(int i = 0; i < (n); i++)
#define tag(i,v) rep(i,SZ(v))
#define _tr(x) #x<<" = "<<(x)
#define trace(x) {if(!OJ)cerr<<_tr(x)<<endl;}
#define trace2(x,y) {if(!OJ)cerr<<_tr(x)<<" "<<_tr(y)<<endl;}
#define trace3(x,y,z) {if(!OJ)cerr<<_tr(x)<<" "<<_tr(y)<<""<<_tr(z)<<endl;}
#define fst get<0>
#define snd get<1>
#define thd get<2>
#define divup(x,y) ((x)/(y)+(0<((x)%(y))))
#define mp make_tuple
#define range(x,a,b) ((x) >= (a) && (x) <= (b))
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef tuple<int,int> int2;
const int INF = 1LL << 60;
template<class T> ostream& operator<<(ostream& os, const vector<T> &v) {
tag(i,v) os << v[i] << " "; return os;
}
template<class T> istream& operator>>(istream& is, vector<T> &v){
tag(i,v) is >> v[i]; return is;
}
template<class A, class B> istream& operator>>(istream& is, tuple<A,B> &p){
is >> fst(p) >> snd(p); return is;
}
void run() {
/* entry point */
int n;
string s;
cin >> n >> s;
vi cnt(4);
rep(i,n){
cnt[s[i]-'1']++;
}
cout << *max_element(all(cnt)) << " " << *min_element(all(cnt)) << endl;
}
#undef int
int main(int argc, char *argv[]) {
#if 0
if(OJ){
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
}
#endif
run();
return 0;
}
Submission Info
Submission Time |
|
Task |
A - センター採点 |
User |
wisterik |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2021 Byte |
Status |
AC |
Exec Time |
20 ms |
Memory |
700 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 |
19 ms |
128 KB |
00_sample2.txt |
AC |
18 ms |
128 KB |
01_rnd_00.txt |
AC |
17 ms |
128 KB |
01_rnd_01.txt |
AC |
18 ms |
128 KB |
01_rnd_02.txt |
AC |
19 ms |
128 KB |
01_rnd_03.txt |
AC |
19 ms |
128 KB |
01_rnd_04.txt |
AC |
19 ms |
128 KB |
01_rnd_05.txt |
AC |
18 ms |
128 KB |
01_rnd_06.txt |
AC |
19 ms |
0 KB |
01_rnd_07.txt |
AC |
19 ms |
128 KB |
01_rnd_08.txt |
AC |
19 ms |
128 KB |
01_rnd_09.txt |
AC |
20 ms |
128 KB |
01_rnd_10.txt |
AC |
19 ms |
700 KB |
01_rnd_11.txt |
AC |
19 ms |
128 KB |
01_rnd_12.txt |
AC |
19 ms |
688 KB |
01_rnd_13.txt |
AC |
19 ms |
692 KB |
01_rnd_14.txt |
AC |
19 ms |
676 KB |
01_rnd_15.txt |
AC |
20 ms |
128 KB |
01_rnd_16.txt |
AC |
19 ms |
128 KB |
01_rnd_17.txt |
AC |
19 ms |
128 KB |
01_rnd_18.txt |
AC |
20 ms |
128 KB |
01_rnd_19.txt |
AC |
19 ms |
128 KB |
02_all_1.txt |
AC |
19 ms |
128 KB |
02_all_2.txt |
AC |
19 ms |
128 KB |
02_all_3.txt |
AC |
19 ms |
128 KB |
02_all_4.txt |
AC |
20 ms |
128 KB |
03_mini_1.txt |
AC |
20 ms |
128 KB |
03_mini_2.txt |
AC |
19 ms |
128 KB |
03_mini_3.txt |
AC |
19 ms |
128 KB |
03_mini_4.txt |
AC |
20 ms |
128 KB |