oj.uz

Submission #51551

# Submission time Handle Problem Language Result Execution time Memory
51551 2018-06-18T14:04:50 Z tranxuanbach Utrka (COCI14_utrka) C++17
80 / 80
 402 ms 17932 KB 
#include<bits/stdc++.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
using namespace std;
// mylittledoge
 
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	int N;
	cin >> N;
	long long x = 0;
	map<string, int> M;
	for (int i = 0; i < N; i++){
		string s;
		cin >> s;
		if (M.find(s) != M.end()) x += M[s];
		else{
			int a = M.size();
			x += a;
			M[s] = a;
		}
	}
	for (int i = 0; i < N - 1; i++){
		string s;
		cin >> s;
		x -= M[s];
	}
	ALL_THE(M,it) if (x == it->ss) cout << it->ff << "\n";
	return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 4 ms 552 KB Output is correct
4 Correct 4 ms 672 KB Output is correct
5 Correct 3 ms 672 KB Output is correct
6 Correct 138 ms 5644 KB Output is correct
7 Correct 272 ms 9476 KB Output is correct
8 Correct 296 ms 12856 KB Output is correct
9 Correct 371 ms 15872 KB Output is correct
10 Correct 402 ms 17932 KB Output is correct