oj.uz

답안 #650844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650844 2022-10-15T17:54:28 Z edogawa_something 마라톤 경주 (COCI14_utrka) C++14
80 / 80
 154 ms 42872 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string st;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define pu push
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(ll i=0;i<n;i++)
#define forx(i,j,n) for(ll i=j;i<n;i++)
#define pb push_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pof pop_front
const ll dx[]{1,0,-1,0};
const ll dy[]{0,1,0,-1};
const ll inf=2e18;
const ll mod=1e9+7;
const ll M=1e6+1;
const ll MM=1002;
const ll MMM=101;
const ld pi=acos(-1);
const ll mod1=1000000321;
ll n,sum,a[M],b[M];
st name[M];
map<st,ll>mp;
int main(){
    fast
    cin>>n;
    forn(i,n){
        cin>>name[i];
        mp[name[i]]++;
    }
    forn(i,n){
        st s;
        cin>>s;
        mp[s]--;
    }
    forn(i,n){
        if(mp[name[i]]>0){
        cout<<name[i];
        return 0;
        }
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 18 ms 31524 KB Output is correct
3 Correct 15 ms 31696 KB Output is correct
4 Correct 16 ms 31700 KB Output is correct
5 Correct 19 ms 31756 KB Output is correct
6 Correct 78 ms 37292 KB Output is correct
7 Correct 138 ms 40008 KB Output is correct
8 Correct 154 ms 41860 KB Output is correct
9 Correct 154 ms 42788 KB Output is correct
10 Correct 140 ms 42872 KB Output is correct