70892023-12-30 11:03:04MagyarKendeSZLGVáltakozó (75 pont)cpp17Wrong answer 0/753ms4812 KiB
#include <bits/stdc++.h>

#define speed cin.tie(0); ios::sync_with_stdio(0)
#define cinv(v) for (auto& e : v) cin >> e;
#define all(v) v.begin(), v.end()
#define has(s, e) s.count(e)

using namespace std;
using ll = long long;
using point = array<int, 2>;

int main() {
    speed;

    int N;
    cin >> N;
    unordered_map<string, int> teamS;
    while (N--) {
        string s;
        cin >> s;
        sort(all(s));
        teamS[s]++;
    }
    
    for (auto [id, db] : teamS) {
        if (db & 1) {
            cout << id;
            exit(0);
        }
    }
}
SubtaskSumTestVerdictTimeMemory
base0/75
1Wrong answer0/03ms1832 KiB
2Wrong answer0/03ms2052 KiB
3Wrong answer0/33ms2268 KiB
4Wrong answer0/33ms2452 KiB
5Wrong answer0/33ms2672 KiB
6Wrong answer0/33ms2884 KiB
7Wrong answer0/33ms3108 KiB
8Wrong answer0/33ms3212 KiB
9Wrong answer0/33ms3496 KiB
10Wrong answer0/33ms3488 KiB
11Wrong answer0/33ms3508 KiB
12Wrong answer0/33ms3896 KiB
13Wrong answer0/33ms3808 KiB
14Wrong answer0/33ms4036 KiB
15Wrong answer0/33ms3892 KiB
16Wrong answer0/33ms3988 KiB
17Wrong answer0/33ms4280 KiB
18Wrong answer0/33ms4260 KiB
19Wrong answer0/33ms4504 KiB
20Wrong answer0/33ms4620 KiB
21Wrong answer0/33ms4444 KiB
22Wrong answer0/63ms4716 KiB
23Wrong answer0/63ms4704 KiB
24Wrong answer0/63ms4812 KiB