Submission #4682235

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct node{
	long long hi;
	int num;
}a[120];
bool cmp(node x,node y)
{
	return x.hi>y.hi;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>a[i].hi,a[i].num=i;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
	cout<<a[i].num<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - 背の順
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 0
Code Size 335 Byte
Status RE
Exec Time 98 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 7
WA × 1
RE × 11
AC × 7
WA × 2
RE × 22
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt RE 97 ms 256 KB
1_06.txt RE 96 ms 256 KB
1_07.txt RE 98 ms 256 KB
1_08.txt RE 96 ms 256 KB
1_09.txt RE 96 ms 256 KB
1_10.txt RE 96 ms 256 KB
1_11.txt RE 95 ms 256 KB
1_12.txt RE 95 ms 256 KB
1_13.txt RE 96 ms 256 KB
1_14.txt RE 96 ms 256 KB
1_15.txt RE 96 ms 256 KB
2_00.txt WA 1 ms 256 KB
2_01.txt RE 96 ms 256 KB
2_02.txt RE 96 ms 256 KB
2_03.txt RE 97 ms 256 KB
2_04.txt RE 96 ms 256 KB
2_05.txt RE 96 ms 256 KB
2_06.txt RE 96 ms 256 KB
2_07.txt RE 96 ms 256 KB
2_08.txt RE 96 ms 256 KB
2_09.txt RE 96 ms 256 KB
2_10.txt RE 96 ms 256 KB
2_11.txt RE 97 ms 256 KB