Task: | Mex value |
Sender: | fjuengermann |
Submission time: | 2017-01-22 15:47:06 +0200 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.15 s | 1 | details |
#2 | WRONG ANSWER | 0.12 s | 1 | details |
#3 | WRONG ANSWER | 0.14 s | 1 | details |
#4 | WRONG ANSWER | 0.15 s | 1 | details |
#5 | ACCEPTED | 0.14 s | 1 | details |
#6 | WRONG ANSWER | 0.15 s | 1 | details |
#7 | WRONG ANSWER | 0.13 s | 1 | details |
#8 | WRONG ANSWER | 0.17 s | 1 | details |
#9 | WRONG ANSWER | 0.13 s | 1 | details |
#10 | ACCEPTED | 0.13 s | 1 | details |
#11 | TIME LIMIT EXCEEDED | -- | 2 | details |
#12 | TIME LIMIT EXCEEDED | -- | 2 | details |
#13 | TIME LIMIT EXCEEDED | -- | 2 | details |
#14 | TIME LIMIT EXCEEDED | -- | 2 | details |
#15 | ACCEPTED | 0.57 s | 2 | details |
#16 | TIME LIMIT EXCEEDED | -- | 2 | details |
#17 | TIME LIMIT EXCEEDED | -- | 2 | details |
#18 | TIME LIMIT EXCEEDED | -- | 2 | details |
#19 | TIME LIMIT EXCEEDED | -- | 2 | details |
#20 | ACCEPTED | 0.62 s | 2 | details |
Code
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; /** * Created by Florian on 22-Jan-17. */ public class MexValue2 { public static void main(String args[]) throws IOException { BufferedReader bi = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(bi.readLine()); int n = Integer.parseInt(st.nextToken()); int k = Integer.parseInt(st.nextToken()); st = new StringTokenizer(bi.readLine()); int[] nums = new int[n]; for (int i = 0; i < n; i++) { nums[i] = Integer.parseInt(st.nextToken()); } TreeMap<Integer, Integer> treeMap = new TreeMap<>(); PriorityQueue<Integer> holes = new PriorityQueue<>(); for (int i = 0; i < k; i++) { int count = 1; if (treeMap.containsKey(nums[i])) { count = treeMap.get(nums[i]) + 1; } treeMap.put(nums[i], count); } int last = -1; for (Integer key : treeMap.keySet()) { if (key - last > 1) { //hole izz da holes.add(key); } last = key; } StringBuilder sb = new StringBuilder(); int posL = 0, posH = k; while (posH <= n) { if (holes.size() > 0) { int hole = holes.peek(); Integer lower = treeMap.lowerKey(hole); if (lower == null) lower = -1; // System.out.print((lower + 1)); sb.append((lower + 1)); } else { // System.out.print((treeMap.lastKey() + 1)); sb.append((treeMap.lastKey() + 1)); } if (posH < n) { int rm = nums[posL]; int add = nums[posH]; int count = treeMap.get(rm); if (count == 1) { treeMap.remove(rm); Integer higher = treeMap.higherKey(rm); if (higher != null) holes.add(higher); } else { treeMap.put(rm, count - 1); } //add if (treeMap.containsKey(add)) { treeMap.put(add, treeMap.get(add) + 1); } else { treeMap.put(add, 1); Integer next = treeMap.higherKey(add); if (next == null) { //add is highest, test for holes < add Integer lower = treeMap.lowerKey(add); if (add - lower > 1) { holes.add(add); } } else { if (holes.contains(next)) { if (next - add == 1) { holes.remove(next); Integer lower = treeMap.lowerKey(add); if (lower == null) lower = -1; if (add - lower != 1) { //new hols one underneath holes.add(add); } } } } } // System.out.print(' '); sb.append(' '); } posL++; posH++; } System.out.println(sb.toString()); } }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 9 1 0 5 7 2 8 6 3 4... |
correct output |
---|
4 10 9 1 1 1 1 1 1 1 1 4 10 3 ... |
user output |
---|
4 10 9 1 1 1 1 1 1 1 1 2 2 2 0... |
Test 2
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 4 3 8 1 0 9 5 7 2 6... |
correct output |
---|
6 10 4 3 3 1 1 1 1 1 3 3 10 6 ... |
user output |
---|
6 10 4 3 3 1 1 1 1 1 2 2 2 2 2... |
Test 3
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 9 2 3 1 0 8 5 6 4 7... |
correct output |
---|
7 10 9 2 2 1 0 1 1 1 2 9 10 4 ... |
user output |
---|
7 10 9 2 2 1 0 1 1 1 2 3 3 3 3... |
Test 4
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 3 0 4 6 5 7 1 2 8 9... |
correct output |
---|
9 10 3 0 0 0 0 0 4 2 2 2 10 6 ... |
user output |
---|
9 10 3 0 0 0 0 0 4 2 2 2 4 4 4... |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ... |
correct output |
---|
10 10 10 10 10 10 10 10 10 10 ... |
user output |
---|
10 10 10 10 10 10 10 10 10 10 ... |
Test 6
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 0 5 1 9 3 4 6 7 2 8... |
correct output |
---|
8 10 0 5 1 1 1 1 1 5 2 5 10 0 ... |
user output |
---|
8 10 0 5 1 1 1 1 1 5 2 5 6 0 0... |
Test 7
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 1 2 9 3 8 0 4 7 5 6... |
correct output |
---|
6 10 1 1 1 1 2 0 0 2 3 9 10 6 ... |
user output |
---|
6 10 1 1 1 1 2 0 0 2 2 2 2 2 2... |
Test 8
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 5 0 6 7 1 4 8 3 9 2... |
correct output |
---|
2 10 5 0 0 0 0 0 0 0 0 1 10 9 ... |
user output |
---|
2 10 5 0 0 0 0 0 0 0 0 1 1 1 1... |
Test 9
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 10 1000000000 7 3 0 1 4 9 2 5 6 8... |
correct output |
---|
8 10 7 3 0 0 0 0 7 5 5 5 10 8 ... |
user output |
---|
8 10 7 3 0 0 0 0 7 5 5 5 6 6 1... |
Test 10
Group: 1
Verdict: ACCEPTED
input |
---|
100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ... |
correct output |
---|
10 10 10 10 10 10 10 10 10 10 ... |
user output |
---|
10 10 10 10 10 10 10 10 10 10 ... |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 4786 3512 3285 1919... |
correct output |
---|
9547 10000 4786 3512 3285 1919... |
user output |
---|
(empty) |
Test 12
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 7981 3955 790 45 34... |
correct output |
---|
7657 10000 7981 3955 790 45 45... |
user output |
---|
(empty) |
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 2329 1825 9435 3800... |
correct output |
---|
5701 10000 2329 1825 1825 1825... |
user output |
---|
(empty) |
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 2754 6029 8007 6286... |
correct output |
---|
1423 10000 2754 2754 2754 2754... |
user output |
---|
(empty) |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1... |
correct output |
---|
10000 10000 10000 10000 10000 ... |
user output |
---|
10000 10000 10000 10000 10000 ... |
Test 16
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 7560 4634 7044 3853... |
correct output |
---|
9855 10000 7560 4634 4634 3853... |
user output |
---|
(empty) |
Test 17
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 7945 6674 3975 3002... |
correct output |
---|
6373 10000 7945 6674 3975 3002... |
user output |
---|
(empty) |
Test 18
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 2506 6827 6871 8593... |
correct output |
---|
2978 10000 2506 2506 2506 2506... |
user output |
---|
(empty) |
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 10000 1000000000 2769 5036 539 4409 ... |
correct output |
---|
2249 10000 2769 2769 539 539 5... |
user output |
---|
(empty) |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1... |
correct output |
---|
10000 10000 10000 10000 10000 ... |
user output |
---|
10000 10000 10000 10000 10000 ... |