Submission #7463477
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } #define rep(i, n) REP(i, 0, n) #define ALL(v) v.begin(), v.end() #define MSG(a) cout << #a << " " << a << endl; #define REP(i, x, n) for(int i = x; i < n; i++) #define all(x) (x).begin(),(x).end() ll tmp1,tmp2,tmp3; const ll mod = 1e9+7; const int INF = 1e9; const ll INFLONG = 1e18; void swap(ll *x,ll *y){ ll z = *x; *x = *y; *y = z; } void print(vector<ll> vec){ ll length = (ll)vec.size(); rep(i,length){ if(i != 0){cout << " ";} cout << vec[i]; } cout << endl; } int main(){ ll n; cin >> n; vector<string> vec(n); rep(i,n){ cin >> vec[i]; } sort(all(vec)); string strtmp = " ",anstmp = vec[0]; tmp1 = 0; tmp2 = 0; rep(i,n){ if(strtmp == vec[i]){ tmp1++; }else{ strtmp = vec[i]; if(tmp1 > tmp2){ anstmp = vec[i-1]; tmp2 = tmp1; } tmp1 = 0; } } if(tmp1 > tmp2){ anstmp = vec[n-1]; } cout << anstmp << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | ojiso |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1231 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 1 ms | 256 KB |
case_02.txt | AC | 1 ms | 256 KB |
case_03.txt | AC | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 256 KB |
case_06.txt | AC | 1 ms | 256 KB |
case_07.txt | AC | 1 ms | 256 KB |
case_08.txt | AC | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | AC | 1 ms | 256 KB |
case_12.txt | AC | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 1 ms | 256 KB |
case_15.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |