oj.uz

답안 #328703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
328703 2020-11-17T17:43:07 Z aris12345678 마라톤 경주 (COCI14_utrka) C++14
80 / 80
 205 ms 10476 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pi pair<int, int>
#define fi first
#define se second

const int mxN = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;

int n;
map<string, int> mp;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for(int i = 0; i < 2*n-1; i++) {
        string s;
        cin >> s;
        ++mp[s];
    }
    for(pair<string, int> i : mp) {
        if(i.se%2 == 1) cout << i.fi << "\n";
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 81 ms 5612 KB Output is correct
7 Correct 141 ms 7916 KB Output is correct
8 Correct 177 ms 9620 KB Output is correct
9 Correct 205 ms 10476 KB Output is correct
10 Correct 196 ms 10476 KB Output is correct