| Task: | Järjestys |
| Sender: | OulaK |
| Submission time: | 2016-10-14 18:44:43 +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.05 s | 2 | details |
| #3 | WRONG ANSWER | 0.11 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define LOG(x) cout << x << " "
int main() {
int n;
cin >> n;
int x[n], d[n];
for(int i = 0; i < n; i++) {
cin >> x[i];
d[x[i] - 1] = i;
}
for(int i = n; i > 0; i--) {
for(int ii = d[i - 1]; ii >= 0; ii--) {
if(x[ii] == i) {
if(ii + 1 > 1) LOG(ii + 1);
if(i > 1) LOG(i);
if(i - 1 > 1) LOG(i - 1);
if(ii > 1) LOG(ii);
break;
}
}
}
cout << "\n";
return 0;
}
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 |
|---|
| 7 10 9 6 9 8 9 8 7 8 4 7 6 3 5... |
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 |
|---|
| 6 1000 999 5 97 999 998 96 132... |
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 |
|---|
| 35855 100000 99999 35854 3260 ... |