Submission #3970575

---

Source Code Expand

#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

const ll mod = 1e9 + 7;
const ll inf = 1e18;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<ll> A(N);
    vector<ll> B(N);
    FOR(i, 0, N){
        ll a;
        cin >> a;
        A[i] = B[i] = a;
    }

    sort(ALL(A));
    auto it = unique(ALL(A));
    A.erase(it, A.end());

    map<ll, ll> mp;
    FOR(i, 0, A.size()){
        mp[A[i]] = i;
    }

    for(ll b : B){
        p(mp[b]);
    }

    return 0;
}

Submission Info

Judge Result