oj.uz

답안 #1104415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1104415 2024-10-23T17:19:12 Z qrn 마라톤 경주 (COCI14_utrka) C++14
0 / 80
 1000 ms 9440 KB 
#include <bits/stdc++.h>
using namespace std;
 
template<class ISqr, class T>
ISqr& operator>>(ISqr& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
 
#define SPEED                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(NULL);                \
    cout.tie(NULL);
 
template <typename T>
void show(vector<T> &v) {
  for (T i : v) {
    cout << i << ' ';
  }
  cout << endl;
}

 
#define pb push_back
#define ins insert
#define fi first
#define se second
 
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define sz(x) x.size()
#define int long long
#define _ << " " <<
#define no cout << "No" << endl;
#define yes cout << "Yes" << endl;
#define impos cout << -1 << endl;
 
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
 
void solve() {
    map<string,int>cnt, cntt;
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        cnt[s]++;
        cntt[s] = 0;
    }
    for(int i = 1; i <= n-1; i++) {
        string s;
        cin >> s;
        cntt[s]++;
    }
    for(auto it : cnt) {
        for(auto itt : cntt) {
            if(it.fi == itt.fi) {
                if(it.se != itt.se) {
                    cout << it.fi << endl;
                    return;
                }
            }
        }
    }
}
 
signed main(){
    SPEED;
    int t = 1;
    // cin >> t;
    for(int cs = 1; cs <= t; cs++) {
        solve();
    }
}

Subtask #1
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 11 ms 592 KB Output is correct
5 Correct 6 ms 760 KB Output is correct
6 Execution timed out 1086 ms 9440 KB Time limit exceeded
7 Halted 0 ms 0 KB -