| Task: | Järjestys |
| Sender: | katsotkos NaN |
| Submission time: | 2016-10-16 10:57:48 +0300 |
| Language: | Python3 |
| 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.20 s | 2 | details |
| #3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
n = int(input())
t = [int(i) for i in input().split(" ")]
pairs = zip(t, list(range(1, n+1)))
sor = sorted(pairs)
pairs = zip(*pairs)
order = list(zip(*sor))[1]
adjust = [0]*(n+1)
for x in t:
i = 0
while t[i] != x:
if t[i] > x:
adjust[x] += 1
i+=1
res = ""
m = 0
for x in reversed(order):
print(str(x) + " " + str(t[x-1]))
a = x-adjust[t[x-1]]
if (a > 1):
res += str(a-1) +" "+ str(a) +" "
m += 2
if (n > 1):
res += str(n) +" "+ str(n-1) +" "
m += 2
n -= 1
print(m)
print(res)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 1 9 9 8 4 7 5 6 ... |
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 97 999 132 998 797 997 159 996 ... |
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) |