# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
201309 | 2020-02-10T07:28:57 Z | ArKCa | 마라톤 경주 (COCI14_utrka) | C++17 | 338 ms | 10488 KB |
#include<bits/stdc++.h> #define f1 first #define s2 second #define pb push_back #define pob pop_back #define int ll #define ll long long #define PII pair<int,int> #define N 11 using namespace std; int n,a,last,b; int dizi[N]; map<string,int>m; map<string,int>::iterator it; string s; int32_t main(){ // freopen("a.gir","r",stdin); // freopen("a.cik","w",stdout); scanf("%lld",&n); for(int i=1;i<=n;i++){ cin>>s; m[s]++; } for(int i=1;i<n;i++){ cin>>s; m[s]++; } for(it=m.begin();it!=m.end();it++){ if(it->s2%2==1){ cout<<it->f1<<endl; return 0; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 256 KB | Output is correct |
3 | Correct | 6 ms | 376 KB | Output is correct |
4 | Correct | 7 ms | 504 KB | Output is correct |
5 | Correct | 7 ms | 376 KB | Output is correct |
6 | Correct | 142 ms | 5496 KB | Output is correct |
7 | Correct | 228 ms | 7928 KB | Output is correct |
8 | Correct | 283 ms | 9592 KB | Output is correct |
9 | Correct | 338 ms | 10488 KB | Output is correct |
10 | Correct | 329 ms | 10488 KB | Output is correct |