Task: | Järjestys |
Sender: | YvMa^Na9 |
Submission time: | 2016-10-05 18:21:09 +0300 |
Language: | Java |
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.10 s | 1 | details |
#2 | WRONG ANSWER | 0.14 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
//import java.util.Scanner; //import java.util.TreeMap; //import java.util.Set; //import java.util.*; import java.util.TreeMap; import java.util.Iterator; import java.util.Set; import java.util.Map; import java.util.Collections; //import java.util.Arrays; //import java.util.ArrayList; public class jarjestys2 { public static void main (String[] args) { //Jarjestys(); IO io = new IO(); // Scanner scanner = new Scanner(System.in); // int a = scanner.nextInt(); int a = io.nextInt();//scanner.nextInt(); //int y; int[] nums = new int[a]; int[] turns = new int[a]; for (int j = 0; j < a; j++) { nums[j] = io.nextInt();//scanner.nextInt(); turns[j] = j+1; } //System.out.println(a*4); io.println(a*4); for (int i = 0; i < a; i++) { for (int j = i; j < a; j++) {//optim if (nums[i] > nums[j]) { turns[j]--; //System.out.println("J: " + j); //System.out.println(turns[j]); } } } //create map from nums -> turns //sort based on nums //print largest num 1. //print turns[indexof(largestnum)] //print curr arr length //curr arr length-- //print arr length //print posoflargestnum (index) TreeMap tm = new TreeMap(Collections.reverseOrder()); for (int i = 0; i < nums.length; i++) { tm.put(nums[i], turns[i]); } Set set = tm.entrySet(); Iterator i = set.iterator(); // Display elements while(i.hasNext()) { Map.Entry me = (Map.Entry)i.next(); int temp = (int) me.getValue(); //System.out.println("Keyvalue: " + me.getKey()); //System.out.print(temp + " "); //System.out.print(a-- + " "); //System.out.print(a + " "); //System.out.print(temp - 1 + " "); int temp2 = temp - 1; io.print(temp + " " + a-- + " " + a + temp2 + " "); /* io.print(a-- + " "); io.print(a + " "); io.print(temp - 1 + " "); */ } } }
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 |
---|
(empty) |
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 |
---|
(empty) |
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) |