Submission #3240054
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; typedef pair<int, int> P; int N; int a[100]; vector<P> h; int ret_index(int x, int index_option){ int y; if (index_option == 1){ y = x; } else{ y = N - x - 1; } return y + 1; } int main(){ cin >> N; int mi = 10000000, mi_index = -1; int ma = -10000000, ma_index = -1; for(int i = 0; i < N; i++){ cin >> a[i]; if(mi > a[i]) { mi = a[i]; mi_index = i; } if(ma < a[i]) { ma = a[i]; ma_index = i; } } int index_option = 1; if(-mi > ma){ for(int i = 0; i < N; i++){ a[i] = -a[i]; } for(int i = 0; i < N / 2; i++){ swap(a[i], a[N-i-1]); } ma = -mi; ma_index = N - mi_index - 1; index_option = -1; } int s = 0; for(int i = 1; i < N; i++){ if(a[i] >= a[i-1]) continue; a[i] += ma; h.emplace_back(P(ret_index(i, index_option), ret_index(ma_index, index_option))); s++; if(a[i] >= a[i-1]) continue; a[i] += ma; h.emplace_back(P(ret_index(i, index_option), ret_index(ma_index, index_option))); if(a[i] > ma){ ma = a[i]; ma_index = i; } s++; } cout << s << endl; for(int i = 0; i < s; i++){ cout << h[i].second << " " << h[i].first << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Non-decreasing |
User | bomac1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1620 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | WA | 1 ms | 256 KB |
09.txt | WA | 1 ms | 256 KB |
10.txt | WA | 1 ms | 256 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | WA | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | WA | 1 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | WA | 1 ms | 256 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | WA | 1 ms | 256 KB |
29.txt | WA | 1 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | WA | 1 ms | 256 KB |
36.txt | WA | 1 ms | 256 KB |
37.txt | WA | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |