Submission #1246338
Source Code Expand
#include <iostream> #include <string> #include <sstream> #include <algorithm> #include <vector> #include <utility> #include <functional> #include <stack> #include <queue> #include <map> #include <set> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <deque> #include <ctime> using namespace std; #define rep(i,n) REP(i,0,n) #define REP(i,s,e) for(int i=(s); i<(int)(e); i++) #define pb push_back #define mp make_pair #define all(r) (r).begin(),(r).end() #define rall(r) (r).rbegin(),(r).rend() #define fi first #define se second #define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0])) typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; const ll MOD = 1e9 + 7; double EPS = 1e-8; const double PI = acos(-1); int dx[]={-1,1,0,0}; int dy[]={0,0,-1,1}; int main(){ int n; cin >> n; int a[int(1e5)+5]; vector<pair<int, int> > v; for(int i=0; i<n; i++){ int tmp; cin >> tmp; v.pb(mp(tmp, i)); } stable_sort(v.begin(), v.end(), greater<pair<int, int> >()); for(int i=0; i<n; i++){ cout << v[i].second+1 << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - 背の順 |
User | misogil0116 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1310 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 1908 KB |
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 | 2 ms | 384 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 | AC | 3 ms | 256 KB |
1_05.txt | AC | 3 ms | 256 KB |
1_06.txt | AC | 3 ms | 256 KB |
1_07.txt | AC | 3 ms | 256 KB |
1_08.txt | AC | 3 ms | 256 KB |
1_09.txt | AC | 3 ms | 256 KB |
1_10.txt | AC | 3 ms | 256 KB |
1_11.txt | AC | 3 ms | 256 KB |
1_12.txt | AC | 3 ms | 256 KB |
1_13.txt | AC | 3 ms | 256 KB |
1_14.txt | AC | 3 ms | 256 KB |
1_15.txt | AC | 2 ms | 256 KB |
2_00.txt | AC | 185 ms | 1908 KB |
2_01.txt | AC | 184 ms | 1908 KB |
2_02.txt | AC | 195 ms | 1908 KB |
2_03.txt | AC | 196 ms | 1908 KB |
2_04.txt | AC | 200 ms | 1908 KB |
2_05.txt | AC | 200 ms | 1908 KB |
2_06.txt | AC | 204 ms | 1908 KB |
2_07.txt | AC | 204 ms | 1908 KB |
2_08.txt | AC | 151 ms | 1524 KB |
2_09.txt | AC | 186 ms | 1780 KB |
2_10.txt | AC | 60 ms | 792 KB |
2_11.txt | AC | 163 ms | 1652 KB |