oj.uz

Submission #650192

# Submission time Handle Problem Language Result Execution time Memory
650192 2022-10-12T16:47:57 Z TeKe Utrka (COCI14_utrka) C++17
80 / 80
 98 ms 11176 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
//typedef int ll;
typedef long long ll;
typedef unsigned long long ull;
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e15+7; 
const ll ous = 2e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
std::vector<std::string> ar;
ll n;
void solve(){
    std::cin >> n;
    ar.resize(2 * n - 1);
    for(ll i = 0;2*n-1 > i;i++){
        std::string h;std::cin >> ar[i];
    }
    std::sort(all(ar));
    for(ll i = 0;2*n-2>i;i+=2){
        if(ar[i] != ar[i+1]){
            std::cout << ar[i] << "\n";
            return;
        }
    }
    std::cout << ar[2*n-2] << "\n";
    return; /**/
}
signed main(){
    std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
    ll t=1;
    //std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0; 
}

Compilation message

utrka.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
utrka.cpp: In function 'int main()':
utrka.cpp:45:8: warning: unused variable 'o' [-Wunused-variable]
   45 |     ll o = 1;
      |        ^

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 42 ms 5632 KB Output is correct
7 Correct 64 ms 8296 KB Output is correct
8 Correct 79 ms 10196 KB Output is correct
9 Correct 98 ms 11176 KB Output is correct
10 Correct 89 ms 11088 KB Output is correct