Task: | Järjestys |
Sender: | OulaK |
Submission time: | 2016-10-04 11:54:57 +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.06 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int x[n]; vector<int> moves; for(int i = 0; i < n; i++) cin >> x[i]; for(int i = n - 1; i >= 0; i--) { for(int ii = i; ii >= 0; ii--) { if(ii == i && x[ii] == i + 1) break; if(x[ii] == i + 1) { reverse(x, x + ii + 1); reverse(x, x + i + 1); moves.push_back(ii + 1); moves.push_back(i + 1); } } } cout << moves.size() << '\n'; for(int i : moves) cout << i << " "; cout << '\n'; 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 |
---|
12 7 10 4 9 7 8 4 7 3 4 1 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 |
---|
1984 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) |