結果
問題 | No.1722 [Cherry 3rd Tune C] In my way |
ユーザー | neko_the_shadow |
提出日時 | 2021-11-07 02:06:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 3,067 bytes |
コンパイル時間 | 2,984 ms |
コンパイル使用メモリ | 84,192 KB |
実行使用メモリ | 40,964 KB |
最終ジャッジ日時 | 2024-11-08 01:53:35 |
合計ジャッジ時間 | 6,548 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
37,548 KB |
testcase_01 | AC | 82 ms
38,520 KB |
testcase_02 | AC | 124 ms
40,228 KB |
testcase_03 | AC | 123 ms
39,996 KB |
testcase_04 | AC | 118 ms
39,824 KB |
testcase_05 | AC | 103 ms
38,548 KB |
testcase_06 | AC | 79 ms
38,412 KB |
testcase_07 | AC | 94 ms
38,260 KB |
testcase_08 | AC | 130 ms
40,928 KB |
testcase_09 | AC | 96 ms
38,736 KB |
testcase_10 | AC | 75 ms
38,172 KB |
testcase_11 | AC | 132 ms
40,756 KB |
testcase_12 | AC | 122 ms
40,396 KB |
testcase_13 | AC | 122 ms
40,964 KB |
testcase_14 | AC | 124 ms
40,604 KB |
testcase_15 | AC | 137 ms
40,660 KB |
testcase_16 | AC | 134 ms
40,816 KB |
testcase_17 | AC | 133 ms
40,852 KB |
testcase_18 | AC | 124 ms
40,804 KB |
testcase_19 | AC | 127 ms
40,832 KB |
testcase_20 | AC | 133 ms
40,496 KB |
testcase_21 | AC | 66 ms
37,656 KB |
testcase_22 | AC | 66 ms
37,552 KB |
ソースコード
import java.io.BufferedReader; import java.io.EOFException; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.PrintStream; import java.io.PrintWriter; import java.io.UncheckedIOException; import java.math.BigInteger; import java.util.ArrayDeque; import java.util.Deque; import java.util.TreeSet; import java.util.regex.Pattern; public class Main { public void exec() { int n = stdin.nextInt(); int m = stdin.nextInt(); int[] x = new int[n]; TreeSet<Integer> y = new TreeSet<>(); for (int i = 0; i < n; i++) { x[i] = stdin.nextInt(); } for (int i = 0; i < m; i++) { y.add(stdin.nextInt()); } for (int i = 0; i < n; i++) { Integer pos = y.ceiling(x[i]); if (pos == null) { stdout.println("Infinity"); } else { stdout.println(pos-x[i]); } } } private static final Stdin stdin = new Stdin(System.in); private static final Stdout stdout = new Stdout(System.out); public static void main(String[] args) { try { new Main().exec(); } finally { stdout.flush(); } } public static class Stdin { private Deque<String> queue; private BufferedReader in; private Pattern space; public Stdin(InputStream in) { this.queue = new ArrayDeque<>(); this.in = new BufferedReader(new InputStreamReader(in)); this.space = Pattern.compile(" "); } public String nextString() { if (queue.isEmpty()) { try { String line = in.readLine(); if (line == null) { throw new EOFException(); } space.splitAsStream(line).forEach(this.queue::addLast); } catch (IOException e) { throw new UncheckedIOException(e); } } return queue.removeFirst(); } public int nextInt() { return Integer.parseInt(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public BigInteger nextBigInteger() { return new BigInteger(nextString()); } } public static class Stdout { private PrintWriter stdout; public Stdout(PrintStream stdout) { this.stdout = new PrintWriter(stdout, false); } public void println(Object ... objs) { for (int i = 0, len = objs.length; i < len; i++) { stdout.print(objs[i]); if (i != len-1) stdout.print(' '); } stdout.println(); } public void flush() { stdout.flush(); } } }