# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60943 | 0xrgb | Utrka (COCI14_utrka) | C++17 | 185 ms | 17432 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 <iostream>
#include <string>
#include <unordered_set>
#include <cassert>
int main() {
using namespace std;
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
N = N * 2 - 1;
unordered_set<string> s;
string x;
for (int i = N; i--; ) {
cin >> x;
auto it = s.find(x);
if (it == s.end()) s.insert(x);
else s.erase(it);
}
assert(s.size() == 1);
cout << (*s.begin()) << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |