Submission #25560866

Source Code Expand

#include <iostream>
using namespace std;

int N;
int P[200005], Q[200005];

int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> P[i];
    Q[P[i]-1] = i+1;
  }
  for (int i = 0; i < N; i++) {
    printf("%d ", Q[i]);
  }
  puts("");

}

Submission Info

Submission Time
Task C - Inverse of Permutation
User daimatz
Language C++ (GCC 9.2.1)
Score 300
Code Size 269 Byte
Status AC
Exec Time 69 ms
Memory 5212 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 11
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_n_eq_3_00.txt, 01_n_eq_3_01.txt, 01_n_eq_3_02.txt, 01_n_eq_3_03.txt, 02_random_00.txt, 02_random_01.txt, 02_random_02.txt, 03_max_00.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 7 ms 3596 KiB
00_sample_01.txt AC 2 ms 3760 KiB
00_sample_02.txt AC 2 ms 3704 KiB
01_n_eq_3_00.txt AC 2 ms 3760 KiB
01_n_eq_3_01.txt AC 2 ms 3540 KiB
01_n_eq_3_02.txt AC 3 ms 3576 KiB
01_n_eq_3_03.txt AC 2 ms 3580 KiB
02_random_00.txt AC 44 ms 4388 KiB
02_random_01.txt AC 14 ms 3708 KiB
02_random_02.txt AC 69 ms 5096 KiB
03_max_00.txt AC 68 ms 5212 KiB