# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919128 | TIN | Utrka (COCI14_utrka) | C++17 | 2 ms | 3672 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 FNAME "test"
const int N = 1e5 + 5;
int n;
string s[N];
unordered_map<string, int> mp;
bool b[N];
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
void Solve() {
//Your Code
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]] = i;
}
memset(b, false, sizeof(b));
for (int i = 1; i < n; i++) {
string t;
cin >> t;
b[mp[t]] = true;
}
for (int i = 1; i <= n; i++) {
if (!b[i]) {
cout << s[i];
}
}
}
int main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |