結果
問題 | No.8016 unordered_mapなるたけ落とすマン |
ユーザー | rn4ru |
提出日時 | 2016-05-22 00:45:37 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 13,585 bytes |
コンパイル時間 | 2,709 ms |
コンパイル使用メモリ | 84,164 KB |
実行使用メモリ | 66,156 KB |
最終ジャッジ日時 | 2024-10-07 05:41:56 |
合計ジャッジ時間 | 17,600 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | MLE | - |
testcase_02 | MLE | - |
testcase_03 | MLE | - |
testcase_04 | MLE | - |
testcase_05 | MLE | - |
testcase_06 | MLE | - |
testcase_07 | MLE | - |
testcase_08 | MLE | - |
testcase_09 | MLE | - |
testcase_10 | MLE | - |
testcase_11 | MLE | - |
testcase_12 | MLE | - |
testcase_13 | MLE | - |
testcase_14 | MLE | - |
testcase_15 | MLE | - |
testcase_16 | MLE | - |
testcase_17 | MLE | - |
testcase_18 | MLE | - |
testcase_19 | MLE | - |
testcase_20 | MLE | - |
testcase_21 | MLE | - |
testcase_22 | MLE | - |
testcase_23 | MLE | - |
testcase_24 | MLE | - |
testcase_25 | MLE | - |
testcase_26 | MLE | - |
testcase_27 | MLE | - |
testcase_28 | MLE | - |
testcase_29 | MLE | - |
testcase_30 | MLE | - |
testcase_31 | MLE | - |
testcase_32 | MLE | - |
testcase_33 | MLE | - |
testcase_34 | MLE | - |
testcase_35 | MLE | - |
testcase_36 | MLE | - |
testcase_37 | MLE | - |
testcase_38 | MLE | - |
testcase_39 | MLE | - |
testcase_40 | MLE | - |
testcase_41 | MLE | - |
testcase_42 | MLE | - |
testcase_43 | MLE | - |
testcase_44 | MLE | - |
testcase_45 | MLE | - |
testcase_46 | MLE | - |
testcase_47 | MLE | - |
testcase_48 | MLE | - |
testcase_49 | MLE | - |
testcase_50 | MLE | - |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.AbstractSet; import java.util.InputMismatchException; import java.util.Random; import java.util.Map; import java.io.OutputStreamWriter; import java.util.NoSuchElementException; import java.io.OutputStream; import java.io.PrintWriter; import java.util.Iterator; import java.io.BufferedWriter; import java.util.Set; import java.io.IOException; import java.util.AbstractMap; import java.util.StringJoiner; import java.io.Writer; import java.util.Map.Entry; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author rn4ru */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); OutputWriter out = new OutputWriter(outputStream); Task3016 solver = new Task3016(); solver.solve(1, in, out); out.close(); } static class Task3016 { public void solve(int testNumber, InputReader in, OutputWriter out) { int N = in.readInt(); int M = in.readInt(); MultiSet<Long> A = new MultiSet<>(); for (int i = 0; i < N; i++) { A.add(in.readLong()); } StringJoiner sj = new StringJoiner(" "); for (int i = 0; i < M; i++) { sj.add(String.valueOf(A.get(in.readLong()))); } out.printLine(sj.toString()); } } static class EHashMap<E, V> extends AbstractMap<E, V> { private static final int[] shifts = new int[10]; private int size; private EHashMap.HashEntry<E, V>[] data; private int capacity; private Set<Entry<E, V>> entrySet; static { Random random = new Random(System.currentTimeMillis()); for (int i = 0; i < 10; i++) { shifts[i] = 1 + 3 * i + random.nextInt(3); } } public EHashMap() { this(4); } private void setCapacity(int size) { capacity = Integer.highestOneBit(4 * size); //noinspection unchecked data = new EHashMap.HashEntry[capacity]; } public EHashMap(int maxSize) { setCapacity(maxSize); entrySet = new AbstractSet<Entry<E, V>>() { public Iterator<Entry<E, V>> iterator() { return new Iterator<Entry<E, V>>() { private EHashMap.HashEntry<E, V> last = null; private EHashMap.HashEntry<E, V> current = null; private EHashMap.HashEntry<E, V> base = null; private int lastIndex = -1; private int index = -1; public boolean hasNext() { if (current == null) { for (index++; index < capacity; index++) { if (data[index] != null) { base = current = data[index]; break; } } } return current != null; } public Entry<E, V> next() { if (!hasNext()) { throw new NoSuchElementException(); } last = current; lastIndex = index; current = current.next; if (base.next != last) { base = base.next; } return last; } public void remove() { if (last == null) { throw new IllegalStateException(); } size--; if (base == last) { data[lastIndex] = last.next; } else { base.next = last.next; } } }; } public int size() { return size; } }; } public EHashMap(Map<E, V> map) { this(map.size()); putAll(map); } public Set<Entry<E, V>> entrySet() { return entrySet; } public void clear() { Arrays.fill(data, null); size = 0; } private int index(Object o) { return getHash(o.hashCode()) & (capacity - 1); } private int getHash(int h) { int result = h; for (int i : shifts) { result ^= h >>> i; } return result; } public V remove(Object o) { if (o == null) { return null; } int index = index(o); EHashMap.HashEntry<E, V> current = data[index]; EHashMap.HashEntry<E, V> last = null; while (current != null) { if (current.key.equals(o)) { if (last == null) { data[index] = current.next; } else { last.next = current.next; } size--; return current.value; } last = current; current = current.next; } return null; } public V put(E e, V value) { if (e == null) { return null; } int index = index(e); EHashMap.HashEntry<E, V> current = data[index]; if (current != null) { while (true) { if (current.key.equals(e)) { V oldValue = current.value; current.value = value; return oldValue; } if (current.next == null) { break; } current = current.next; } } if (current == null) { data[index] = new EHashMap.HashEntry<E, V>(e, value); } else { current.next = new EHashMap.HashEntry<E, V>(e, value); } size++; if (2 * size > capacity) { EHashMap.HashEntry<E, V>[] oldData = data; setCapacity(size); for (EHashMap.HashEntry<E, V> entry : oldData) { while (entry != null) { EHashMap.HashEntry<E, V> next = entry.next; index = index(entry.key); entry.next = data[index]; data[index] = entry; entry = next; } } } return null; } public V get(Object o) { if (o == null) { return null; } int index = index(o); EHashMap.HashEntry<E, V> current = data[index]; while (current != null) { if (current.key.equals(o)) { return current.value; } current = current.next; } return null; } public boolean containsKey(Object o) { if (o == null) { return false; } int index = index(o); EHashMap.HashEntry<E, V> current = data[index]; while (current != null) { if (current.key.equals(o)) { return true; } current = current.next; } return false; } public int size() { return size; } private static class HashEntry<E, V> implements Entry<E, V> { private final E key; private V value; private EHashMap.HashEntry<E, V> next; private HashEntry(E key, V value) { this.key = key; this.value = value; } public E getKey() { return key; } public V getValue() { return value; } public V setValue(V value) { V oldValue = this.value; this.value = value; return oldValue; } } } static class InputReader { private InputStream stream; private byte[] buf = new byte[1024]; private int curChar; private int numChars; private InputReader.SpaceCharFilter filter; public InputReader(InputStream stream) { this.stream = stream; } public int read() { if (numChars == -1) { throw new InputMismatchException(); } if (curChar >= numChars) { curChar = 0; try { numChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (numChars <= 0) { return -1; } } return buf[curChar++]; } public int readInt() { int c = read(); while (isSpaceChar(c)) { c = read(); } int sgn = 1; if (c == '-') { sgn = -1; c = read(); } int res = 0; do { if (c < '0' || c > '9') { throw new InputMismatchException(); } res *= 10; res += c - '0'; c = read(); } while (!isSpaceChar(c)); return res * sgn; } public long readLong() { int c = read(); while (isSpaceChar(c)) { c = read(); } int sgn = 1; if (c == '-') { sgn = -1; c = read(); } long res = 0; do { if (c < '0' || c > '9') { throw new InputMismatchException(); } res *= 10; res += c - '0'; c = read(); } while (!isSpaceChar(c)); return res * sgn; } public boolean isSpaceChar(int c) { if (filter != null) { return filter.isSpaceChar(c); } return isWhitespace(c); } public static boolean isWhitespace(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } public interface SpaceCharFilter { public boolean isSpaceChar(int ch); } } static class MultiSet<K> implements Iterable<K> { private final Map<K, Integer> map; private int size = 0; public MultiSet() { this(new EHashMap<K, Integer>()); } public MultiSet(Map<K, Integer> underlying) { map = underlying; } public int add(K key) { Integer value = map.get(key); if (value == null) { value = 0; } value++; size++; map.put(key, value); return value; } public int get(K key) { Integer value = map.get(key); if (value == null) { value = 0; } return value; } public boolean equals(Object o) { if (this == o) { return true; } if (o == null || getClass() != o.getClass()) { return false; } MultiSet multiSet = (MultiSet) o; return !(map != null ? !map.equals(multiSet.map) : multiSet.map != null); } public int hashCode() { return map.hashCode(); } public Iterator<K> iterator() { return map.keySet().iterator(); } } static class OutputWriter { private final PrintWriter writer; public OutputWriter(OutputStream outputStream) { writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream))); } public OutputWriter(Writer writer) { this.writer = new PrintWriter(writer); } public void print(Object... objects) { for (int i = 0; i < objects.length; i++) { if (i != 0) { writer.print(' '); } writer.print(objects[i]); } } public void printLine(Object... objects) { print(objects); writer.println(); } public void close() { writer.close(); } } }