Task: | Järjestys |
Sender: | comp |
Submission time: | 2016-10-08 14:05:43 +0300 |
Language: | C++ |
Status: | READY |
Result: | 56 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 19 |
#2 | ACCEPTED | 37 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>#include <vector>#include <algorithm>int n;int sorted = 0;std::vector<int> reverses_k;std::vector<int> sort(int index, std::vector<int> values) {if (index != 0) {reverses_k.push_back(index + 1);std::reverse(values.begin(), values.begin() + index + 1);}reverses_k.push_back(n - sorted);std::reverse(values.begin(), values.end() - sorted);sorted += 1;return values;}int main() {std::cin >> n;std::vector<int> values;int x;for(int i = 0; i < n; ++i) {std::cin >> x;values.push_back(x);}for(int v = n; v > 0; --v) {for(int i = 0; i < n; ++i) {if (i == n - sorted - 1) {sorted += 1;} else if (v == values[i] && i != n - 1) {values = sort(i, values);break;}}}std::cout << reverses_k.size() << "\n";for(auto k: reverses_k) {std::cout << k << " ";}return 0;}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
10 9 3 4 7 6 5 10 2 8 1 |
correct output |
---|
32 10 10 9 10 9 8 7 9 4 2 1 4 5 2... |
user output |
---|
11 7 10 4 9 7 8 4 7 3 4 2 |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
1000 650 716 982 41 133 1000 876 92... |
correct output |
---|
3984 207 207 206 207 128 127 126 12... |
user output |
---|
1976 6 1000 904 999 964 998 333 997... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 94703 47808 62366 31885 7091 8... |
correct output |
---|
399956 98676 98676 98675 98676 62994 ... |
user output |
---|
(empty) |