# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
165094 |
2019-11-25T06:41:31 Z |
Atill83 |
Utrka (COCI14_utrka) |
C++14 |
|
301 ms |
12280 KB |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
vector<string> cont;
map<string, int> mp;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("../IO/int.txt","r",stdin);
freopen("../IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 0; i < n; i++){
string s;
cin>>s;
cont.push_back(s);
}
for(int i = 0; i < n - 1; i++){
string s;
cin>>s;
mp[s]++;
}
for(int i = 0; i < n; i++){
if(!mp[cont[i]]){
cout<<cont[i]<<endl;
break;
}
mp[cont[i]]--;
}
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
504 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
79 ms |
6280 KB |
Output is correct |
7 |
Correct |
167 ms |
9216 KB |
Output is correct |
8 |
Correct |
165 ms |
11136 KB |
Output is correct |
9 |
Correct |
301 ms |
12132 KB |
Output is correct |
10 |
Correct |
288 ms |
12280 KB |
Output is correct |