QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#363569#7933. Build Permutationbobbilyking#RE 0ms3544kbC++201.2kb2024-03-24 00:25:072024-03-24 00:25:08

Judging History

你现在查看的是最新测评结果

  • [2024-03-24 00:25:08]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:3544kb
  • [2024-03-24 00:25:07]
  • 提交

answer

#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

template<typename A, typename B>
A& chmax(A &a, B b) { return a < b ? (a=b): a; }

template<typename A, typename B>
A& chmin(A &a, B b) { return a > b ? (a=b): a; }




const ll M = 1000000007; // 998244353


int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);

    G(n)
    map<ll, ll> pos;

    vl a;
    F(i, 1, n + 1) {
        G(x) pos[x] = i;
        a.push_back(x);
    } 

    F(i, 0, n) {
        cout << pos.at(n - a[i] + 1) << " ";
    }
    cout << endl;

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3544kb

input:

5
4 2 5 1 3

output:

2 1 4 3 5 

result:

ok 

Test #2:

score: -100
Runtime Error

input:

3
2 2 3

output:


result: