Submission #793662
Source Code Expand
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
pair<int,int> p[100000];
int n;
scanf("%d", &n);
for(int i=0; i<n; i++) {
int a;
scanf("%d", &a);
p[i] = make_pair(a,i);
}
sort(p, p+n);
for(int i=n-1; i>=0; i--) {
printf("%d\n", p[i].second+1);
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - 背の順 |
| User | small |
| Language | C++14 (GCC 5.4.1) |
| Score | 100 |
| Code Size | 349 Byte |
| Status | AC |
| Exec Time | 53 ms |
| Memory | 1536 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:11:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:15:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a);
^
Judge Result
| Set Name | Sample | Subtask1 | All | ||||||
|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
| Status |
|
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 0_00.txt, 0_01.txt, 0_02.txt |
| Subtask1 | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt |
| All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 0_00.txt | AC | 5 ms | 1024 KiB |
| 0_01.txt | AC | 5 ms | 1024 KiB |
| 0_02.txt | AC | 5 ms | 1024 KiB |
| 1_00.txt | AC | 5 ms | 1024 KiB |
| 1_01.txt | AC | 5 ms | 1024 KiB |
| 1_02.txt | AC | 5 ms | 1024 KiB |
| 1_03.txt | AC | 5 ms | 1024 KiB |
| 1_04.txt | AC | 6 ms | 1024 KiB |
| 1_05.txt | AC | 5 ms | 1024 KiB |
| 1_06.txt | AC | 6 ms | 1024 KiB |
| 1_07.txt | AC | 6 ms | 1024 KiB |
| 1_08.txt | AC | 6 ms | 1024 KiB |
| 1_09.txt | AC | 7 ms | 1024 KiB |
| 1_10.txt | AC | 6 ms | 1024 KiB |
| 1_11.txt | AC | 6 ms | 1024 KiB |
| 1_12.txt | AC | 6 ms | 1024 KiB |
| 1_13.txt | AC | 6 ms | 1024 KiB |
| 1_14.txt | AC | 7 ms | 1024 KiB |
| 1_15.txt | AC | 5 ms | 1024 KiB |
| 2_00.txt | AC | 39 ms | 1536 KiB |
| 2_01.txt | AC | 39 ms | 1536 KiB |
| 2_02.txt | AC | 44 ms | 1536 KiB |
| 2_03.txt | AC | 43 ms | 1536 KiB |
| 2_04.txt | AC | 53 ms | 1536 KiB |
| 2_05.txt | AC | 53 ms | 1536 KiB |
| 2_06.txt | AC | 53 ms | 1536 KiB |
| 2_07.txt | AC | 53 ms | 1536 KiB |
| 2_08.txt | AC | 41 ms | 1408 KiB |
| 2_09.txt | AC | 50 ms | 1536 KiB |
| 2_10.txt | AC | 19 ms | 1152 KiB |
| 2_11.txt | AC | 44 ms | 1536 KiB |