| Task: | Järjestys |
| Sender: | gokuha |
| Submission time: | 2016-10-15 20:10:31 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1 | details |
| #2 | WRONG ANSWER | 0.06 s | 2 | details |
| #3 | WRONG ANSWER | 0.12 s | 3 | details |
Code
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int x;
int k;
cout<<5*n-5;
cout<<endl;
int p[n];
int j[n];
for(int a=1; a<=n; a+=1){
cin>>x;
p[x]=a;
j[a]=x;
}
for(int b=0; b<n-1; b+=1){
if(b%2==1){
k=n-b+1-p[n-b];
if (k==n-b){
cout<< k<<" "<<k<<" "<<k<<" "<<k<<" "<<k-1<<" ";}
else{
cout<< k<<" " <<n-b<<" " <<n-b-1<<" " <<max(1, k-2)<<" " <<n-b-1<<" ";}
p[j[n-b]]=p[n-b];
j[p[n-b]]=j[n-b];
}
else{
k=p[n-b];
if (k==n-b){
cout<< k<<" "<<k<<" "<<k<<" "<<k<<" "<<k-1<<" ";}
else{
cout<< max(1,k-1)<<" " <<n-b-1<<" " <<n-b<<" " <<min(n-b-1, k+1)<<" " <<n-b<<" ";}
p[j[n-b]]=p[n-b];
j[p[n-b]]=j[n-b];
}
}
}
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 |
|---|
| 45 6 9 10 8 10 9 9 9 9 8 1 7 8 2 ... |
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 |
|---|
| 4995 5 999 1000 7 1000 903 999 998 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 94703 47808 62366 31885 7091 8... |
| correct output |
|---|
| 399956 98676 98676 98675 98676 62994 ... |
| user output |
|---|
| 499995 35854 99999 100000 35856 10000... |