oj.uz

답안 #210787

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210787 2020-03-18T11:00:27 Z tleontest1 마라톤 경주 (COCI14_utrka) C++14
80 / 80
 225 ms 27256 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s[li];
map<string,int> mpp;
vector<int> v;

int main(void){
	fio();
	cin>>n;
	FOR cin>>s[i];
	for(int i=1;i<n;i++){
		string ss;
		cin>>ss;
		mpp[ss]++;
	}
	FOR{
		if(mpp[s[i]]==0){cout<<s[i]<<endl;return 0;}
		mpp[s[i]]--;
	}
	return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15992 KB Output is correct
2 Correct 14 ms 15992 KB Output is correct
3 Correct 15 ms 15992 KB Output is correct
4 Correct 15 ms 16120 KB Output is correct
5 Correct 15 ms 16120 KB Output is correct
6 Correct 73 ms 21624 KB Output is correct
7 Correct 140 ms 24440 KB Output is correct
8 Correct 154 ms 26232 KB Output is correct
9 Correct 145 ms 27256 KB Output is correct
10 Correct 225 ms 27256 KB Output is correct