# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919128 | 2024-01-31T10:54:34 Z | TIN | Utrka (COCI14_utrka) | C++17 | 2 ms | 3672 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3672 KB | Output is correct |
2 | Incorrect | 2 ms | 3672 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |