Task: | Järjestys |
Sender: | peltola |
Submission time: | 2016-10-16 21:53:36 +0300 |
Language: | Java |
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.13 s | 1 | details |
#2 | ACCEPTED | 0.34 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import java.util.ArrayList;//import java.util.Arrays;//import java.util.HashMap;import java.util.Scanner;//import java.util.TreeSet;//import java.util.TreeMap;public class Teht4 {public static void main(String[] args) {Scanner l = new Scanner(System.in);int n = l.nextInt();// String[] t = l.nextLine().split(" ");// StringBuilder op = new StringBuilder();ArrayList<Integer> g = new ArrayList<>();int[] x = new int[n];// int h = 0;// int[] z = new int[n];// TreeSet<Integer> b = new TreeSet<>();ArrayList<Integer> a = new ArrayList<>();// HashMap<Integer, Integer> c = new HashMap<Integer, Integer>();// TreeMap<Integer, Integer> c = new TreeMap<>();for (int i = 0; i < n; i++) {// int o = Integer.parseInt(t[i]);int o = l.nextInt();a.add(o);x[o - 1] = i;}for (int i = n; i > 1; i--) {for (int j = x[i - 1]; j >= 0; j--) {j = Math.min(j, a.size() - 1);if (a.get(j) == i && j != (i - 1)) {if(j + 1 > 1) {g.add(j + 1);}if (i > 1) {g.add(i);}if(i - 1 > 1) {g.add(i - 1);}if(j > 1) {g.add(j);}a.remove(j);}}}System.out.println(g.size());for (Integer i : g) {System.out.print(i);System.out.print(" ");}System.out.println("");}}
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 |
---|
28 7 10 9 6 9 8 7 8 7 6 3 7 6 2 3... |
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 |
---|
3967 6 1000 999 5 96 999 998 95 130... |
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) |