| Task: | Järjestys |
| Sender: | Senpai |
| Submission time: | 2016-10-04 21:53:20 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.06 s | 1 | details |
| #2 | WRONG ANSWER | 0.06 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
long long a,b,c,d,n;
vector<long long>s;
vector<int> v;
int main(){
cin >> n;
c=n;
vector<int> v;
for(int i=0; i<c;i++){
cin>>b;
v.push_back(b);
}
a=0;
while(!is_sorted(v.begin()+a,v.end())){
auto m=min_element(v.begin(),v.end())-v.begin();
d=m;
reverse(v.begin()+a,v.begin()+(d+1));
s.push_back(d+1);
v[a]=100002;
a++;
}
cout<<a<<"\n";
for(int i=0; i<a;i++){
cout<<s[i]<<" ";
}
}
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| 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 |
|---|
| 9 10 3 9 4 7 6 7 9 10 |
Test 2
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 650 716 982 41 133 1000 876 92... |
| correct output |
|---|
| 3984 207 207 206 207 128 127 126 12... |
| user output |
|---|
| 997 207 81 713 225 530 998 651 761... |
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) |
