oj.uz

Submission #470569

# Submission time Handle Problem Language Result Execution time Memory
470569 2021-09-04T09:48:09 Z watoKE Utrka (COCI14_utrka) C++17
80 / 80
 243 ms 41784 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define forcin for(int i=1;i<=n;i++) scanf("%d",&dizi[i]);
#define forcout for(int i=0;i<n;i++) printf("%d ",dizi[i]);
#define ll long long

using namespace std;
int n,t,cevap;
string s[1000005];
map <string,int> mp;
int main()
{
    cin>>n;
    for(int i=0;i<2*n-1;i++)
    {
        cin>>s[i];
        mp[s[i]]++;
        
    }
   
    for(int i=0;i<2*n;i++)
    {
           if (mp[s[i]]%2==1)
               {
               cout<<s[i]<<endl;
                break;
               }
    }
        
        
       

    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 31504 KB Output is correct
2 Correct 19 ms 31596 KB Output is correct
3 Correct 16 ms 31564 KB Output is correct
4 Correct 18 ms 31612 KB Output is correct
5 Correct 20 ms 31692 KB Output is correct
6 Correct 120 ms 36724 KB Output is correct
7 Correct 186 ms 39164 KB Output is correct
8 Correct 213 ms 40752 KB Output is correct
9 Correct 243 ms 41784 KB Output is correct
10 Correct 219 ms 41740 KB Output is correct