| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1114635 | duytuandao21 | Utrka (COCI14_utrka) | C++17 | 134 ms | 25672 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 7;
string s[N];
int n;
map<string, int> mark, cnt;
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        cnt[s[i]]++;
    }
    for (int i = 1; i < n; i++) {
        string t; cin >> t;
        mark[t]++;
    }
    for (int i = 1; i <= n; i++) {
        if (mark[s[i]] != cnt[s[i]]) {
            cout << s[i];
            break;
        }
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
