/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 30ms 4.316 MiB
#3 Accepted 30ms 4.27 MiB
#4 Accepted 30ms 4.371 MiB
#5 Accepted 29ms 4.363 MiB
#6 Accepted 29ms 4.25 MiB

Code

#include <bits/stdc++.h>  
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
ll tt;
void solve(){
    ll n;
    cin >> n;
    ll a[n];
    map<ll,ll> mp;
    forn(i,n){
        cin >> a[i];
        mp[a[i]]++;
    }
    for(auto x:mp){
        if(x.second==1){
            cout << x.first << ln;
            return;
        }
    }
    return;
}
int main()
{
    fast_cin();
    ll t=1;
    tt=1;
    //cin >> t;
    for(int it=1;it<=t;it++) {
        //cout << "Case " << it << ": ";
        solve();
        tt++;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1095 Uncovering the Lone Heart
Contest
Brain Booster #6
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-03 15:52:55
Judged At
2024-11-11 02:49:44
Judged By
Score
100
Total Time
30ms
Peak Memory
4.371 MiB