Contest Duration: - (local time) (120 minutes) Back to Home

Submission #168823

Source Code Expand

Copy
```#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <sstream>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>
using namespace std;
#define INF	100000000
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define sz(x) ((int)(x).size())
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define clr(a,b) memset((a),(b),sizeof(a))
typedef pair<int, int> P;
typedef long long int ll;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int n;

int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<string> vec(n);
Vi ans(n);
rep(i,n){
cin >> vec[i];
ans[i] = 1;
}
rep(i,n){
for(int j = i+1; j < n; j++){
if(vec[i] == vec[j]) ans[i]++;
}
}
P t;
t.fi = 0;
rep(i,n){
if(ans[i] > t.fi){
t.fi = ans[i];
t.sec = i;
}
}
cout << vec[t.sec] << endl;
}```

Submission Info

Submission Time 2014-05-10 21:06:31+0900 B - 投票 gasin C++ (G++ 4.6.4) 100 1284 Byte AC 29 ms 1056 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
 AC × 3
 AC × 18
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 26 ms 1044 KB
case_02.txt AC 25 ms 1044 KB
case_03.txt AC 23 ms 1040 KB
case_04.txt AC 24 ms 1044 KB
case_05.txt AC 25 ms 1036 KB
case_06.txt AC 25 ms 1044 KB
case_07.txt AC 23 ms 1044 KB
case_08.txt AC 23 ms 1032 KB
case_09.txt AC 23 ms 1044 KB
case_10.txt AC 25 ms 1044 KB
case_11.txt AC 25 ms 1040 KB
case_12.txt AC 24 ms 932 KB
case_13.txt AC 25 ms 1040 KB
case_14.txt AC 27 ms 1056 KB
case_15.txt AC 23 ms 1040 KB
sample_01.txt AC 23 ms 924 KB
sample_02.txt AC 29 ms 1000 KB
sample_03.txt AC 26 ms 1036 KB