Submission #1988889
Source Code Expand
// finish date: 2018/01/18 #include <iostream> #include <cmath> #include <vector> #include <bitset> #include <algorithm> #include <stack> #include <map> #include <climits> using namespace std; #define FOR(i, a, b) for(int (i)=a;(i)<(b);(i)++) #define rep(i, n) FOR(i,0,n) #define ll long long #define bigmod 1000000007 #define INF 500000000 int main() { int N; cin >> N; vector<int> a(N), b(N); map<int, int> mp; rep(i, N) { cin >> a[i]; b[i] = a[i]; } sort(a.begin(), a.end(), greater<int>()); rep(i, N) mp[b[i]] = i + 1; rep(i, N) cout << mp[a[i]]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 背の順 |
User | TASSAN |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 661 Byte |
Status | AC |
Exec Time | 247 ms |
Memory | 7424 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 | 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 | 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 | 223 ms | 6272 KB |
2_01.txt | AC | 218 ms | 6272 KB |
2_02.txt | AC | 231 ms | 6272 KB |
2_03.txt | AC | 234 ms | 6272 KB |
2_04.txt | AC | 242 ms | 6272 KB |
2_05.txt | AC | 245 ms | 6272 KB |
2_06.txt | AC | 241 ms | 6272 KB |
2_07.txt | AC | 247 ms | 6272 KB |
2_08.txt | AC | 183 ms | 4736 KB |
2_09.txt | AC | 232 ms | 7424 KB |
2_10.txt | AC | 70 ms | 1920 KB |
2_11.txt | AC | 199 ms | 5120 KB |