# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81633 | xiaowuc1 | Utrka (COCI14_utrka) | C++14 | 271 ms | 25732 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>
/*
unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count();
mt19937 g1.seed(seed1);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
*/
using namespace std;
const double PI = 2 * acos(0);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, ll> pill;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<vector<ll>> matrix;
map<string, int> dp1;
map<string, int> dp2;
char buf[25];
void load(map<string, int>& dp, int n) {
while(n--) {
scanf("%s", buf);
dp[string(buf)]++;
}
}
int main() {
int n;
scanf("%d", &n);
load(dp1, n);
load(dp2, n-1);
for(auto x: dp1) {
if(dp2[x.first] != x.second) {
cout << x.first << endl;
return 0;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |