Task: | Järjestys |
Sender: | kh |
Submission time: | 2016-10-15 14:13:00 +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.14 s | 1 | details |
#2 | ACCEPTED | 0.34 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import java.util.ArrayList;import java.util.Collections;import java.util.HashMap;import java.util.List;import java.util.Scanner;public class Jarjestys {public static void main(String[] args) {Scanner lukija = new Scanner(System.in);int koko = Integer.parseInt(lukija.nextLine());List<Integer> luvut = new ArrayList<>();List<Integer> kopio = new ArrayList<>();StringBuilder output = new StringBuilder();int kaannot = 0;ArrayList<Integer> kaantolista = new ArrayList<>();boolean lopeta = false;HashMap<Integer, Integer> indeksit = new HashMap<>();for (int i = 0; i < koko; i++) {int luku = lukija.nextInt();luvut.add(luku);indeksit.put(luku, i);}for (int i = koko - 1; i >= 0; i--) {if (luvut.get(i) != i + 1) {int kaanto = haeKaannettavanPaikka(i + 1, indeksit, kaantolista);if (kaanto > 0) {kaannot++;output.append(kaanto + 1).append(" ");kaantolista.add(kaanto + 1);List<Integer> sub;kopio.clear();sub = luvut.subList(0, kaanto + 1);Collections.reverse(sub);kopio.addAll(sub);sub = luvut.subList(kaanto + 1, i + 1);kopio.addAll(sub);} else {kopio.clear();kopio.addAll(luvut);}Collections.reverse(kopio);luvut.clear();luvut.addAll(kopio);kaannot++;output.append(i + 1).append(" ");kaantolista.add(i + 1);} else if (i < 5) {boolean jarjestyksessa = true;for (int j = 0; j < i; j++) {if (luvut.get(j) != j + 1) {jarjestyksessa = false;break;}}if (jarjestyksessa) {lopeta = true;System.out.println(kaannot);System.out.println(output);}if (lopeta) {break;}}luvut.remove(i);if (i % 10000 == 0 || i == 100) {kaantolista.clear();for (int j = 0; j < i; j++) {indeksit.put(luvut.get(j), j);}}}}private static int haeKaannettavanPaikka(int haettava, HashMap<Integer, Integer> ind, ArrayList<Integer> kaannot) {int indeksi = ind.get(haettava);if (!kaannot.isEmpty()) {for (int kaanto : kaannot) {if (indeksi < kaanto) {indeksi = kaanto - indeksi - 1;}}}return indeksi;}}
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 |
---|
11 7 10 4 9 7 8 4 7 3 4 2 |
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 |
---|
1976 6 1000 904 999 964 998 333 997... |
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) |