Submission #316586

# Submission time Handle Problem Language Result Execution time Memory
316586 2020-10-26T18:27:47 Z FatihSolak Utrka (COCI14_utrka) C++17
80 / 80
207 ms 14712 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
void solve(){
    int n;
    cin >> n;
    string s[n];
    map<string,int> mp;
    for(int i=0;i<n;i++){
        cin >> s[i];
        mp[s[i]]++;
    }
    for(int i=0;i<n-1;i++){
        string c;
        cin >> c;
        mp[c]--;
    }
    for(int i=0;i<n;i++){
        if(mp[s[i]]){
            cout << s[i];
            break;
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 84 ms 7548 KB Output is correct
7 Correct 160 ms 11000 KB Output is correct
8 Correct 196 ms 13448 KB Output is correct
9 Correct 207 ms 14712 KB Output is correct
10 Correct 204 ms 14712 KB Output is correct