# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
742242 |
2023-05-16T00:34:04 Z |
thang |
Utrka (COCI14_utrka) |
C++14 |
|
192 ms |
17360 KB |
#include<bits/stdc++.h>
using namespace std;
int n;
string x[100005],y[100005];
map<string ,int> dem;
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>x[i],dem[x[i]]++;
for(int i=1;i<=n-1;i++) cin>>y[i],dem[y[i]]++;
for(int i=1;i<=n;i++)
if(dem[x[i]]%2!=0) {cout<<x[i];break;}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
6484 KB |
Output is correct |
2 |
Correct |
4 ms |
6484 KB |
Output is correct |
3 |
Correct |
4 ms |
6612 KB |
Output is correct |
4 |
Correct |
5 ms |
6612 KB |
Output is correct |
5 |
Correct |
5 ms |
6576 KB |
Output is correct |
6 |
Correct |
84 ms |
12128 KB |
Output is correct |
7 |
Correct |
145 ms |
14528 KB |
Output is correct |
8 |
Correct |
178 ms |
16336 KB |
Output is correct |
9 |
Correct |
192 ms |
17208 KB |
Output is correct |
10 |
Correct |
180 ms |
17360 KB |
Output is correct |