oj.uz

Submission #64517

# Submission time Handle Problem Language Result Execution time Memory
64517 2018-08-04T18:01:46 Z forestryks Utrka (COCI14_utrka) C++14
80 / 80
 192 ms 18020 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

int n;
unordered_multiset<string> s;

int main() {
    FAST_IO;
    cin >> n;
    rep(i, n) {
        string a;
        cin >> a;
        s.insert(a);
    }

    rep(i, n - 1) {
        string a;
        cin >> a;
        s.erase(s.find(a));
    }

    cout << (*s.begin()) << endl;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 5 ms 788 KB Output is correct
5 Correct 5 ms 788 KB Output is correct
6 Correct 79 ms 5692 KB Output is correct
7 Correct 114 ms 9564 KB Output is correct
8 Correct 133 ms 12952 KB Output is correct
9 Correct 192 ms 15868 KB Output is correct
10 Correct 174 ms 18020 KB Output is correct