Task: | Järjestys |
Sender: | ooh |
Submission time: | 2016-10-05 10:20:56 +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.05 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <cstdint> #include <algorithm> #include <vector> #include <string> using std::cout; using std::cin; using std::endl; void print_v(std::vector<uint32_t> &v) { for (auto el : v) { cout << el << " "; } cout << endl; } void swap_n (std::vector<uint32_t> &v, uint32_t n) { uint32_t m = 0; for (uint32_t lim = n/2; n > lim; --n) { std::iter_swap(v.begin()+m, v.begin()+n-1); ++m; } } int main () { uint32_t n; std::vector<uint32_t> v; std::string moves; cin >> n; for (; n>0; --n) { uint32_t next; cin >> next; v.push_back(next); } uint32_t j = 0; for (uint32_t i = v.size(); i>0; --i) { uint32_t pos = std::distance(v.begin(), std::find(v.begin(), v.end(), i)); swap_n(v, pos+1); swap_n(v, i); moves += std::to_string(pos+1) + " "; moves += std::to_string(i) + " "; j += 2; } cout << j << endl; cout << moves.substr(0, moves.length()-1) << endl; 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 |
---|
20 7 10 4 9 7 8 4 7 6 6 5 5 3 4 3... |
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 |
---|
2000 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) |