Submission #4205
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <queue> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <fstream> using namespace std; //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) int main(int argc, char *argv[]){ int N; int cnt[4]; REP(i, 4)cnt[i] = 0; cin >> N; string str; cin >> str; REP(i, str.length())cnt[str[i]-'1']++; sort(cnt, cnt+4); printf("%d %d\n", cnt[3], cnt[0]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - センター採点 |
User | UminchuR |
Language | C++ (GCC 4.4.7) |
Score | 100 |
Code Size | 1649 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 696 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 | 17 ms | 128 KB |
00_sample2.txt | AC | 17 ms | 128 KB |
01_rnd_00.txt | AC | 19 ms | 128 KB |
01_rnd_01.txt | AC | 20 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 | 19 ms | 128 KB |
01_rnd_06.txt | AC | 19 ms | 128 KB |
01_rnd_07.txt | AC | 19 ms | 128 KB |
01_rnd_08.txt | AC | 17 ms | 128 KB |
01_rnd_09.txt | AC | 17 ms | 128 KB |
01_rnd_10.txt | AC | 17 ms | 128 KB |
01_rnd_11.txt | AC | 17 ms | 128 KB |
01_rnd_12.txt | AC | 19 ms | 128 KB |
01_rnd_13.txt | AC | 18 ms | 128 KB |
01_rnd_14.txt | AC | 18 ms | 0 KB |
01_rnd_15.txt | AC | 19 ms | 128 KB |
01_rnd_16.txt | AC | 19 ms | 504 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 | 696 KB |
02_all_1.txt | AC | 19 ms | 128 KB |
02_all_2.txt | AC | 19 ms | 128 KB |
02_all_3.txt | AC | 20 ms | 688 KB |
02_all_4.txt | AC | 19 ms | 128 KB |
03_mini_1.txt | AC | 19 ms | 128 KB |
03_mini_2.txt | AC | 19 ms | 128 KB |
03_mini_3.txt | AC | 20 ms | 688 KB |
03_mini_4.txt | AC | 19 ms | 128 KB |