結果
問題 | No.647 明太子 |
ユーザー | uafr_cs |
提出日時 | 2018-02-09 22:27:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 252 ms / 4,500 ms |
コード長 | 2,714 bytes |
コンパイル時間 | 2,822 ms |
コンパイル使用メモリ | 79,904 KB |
実行使用メモリ | 60,080 KB |
最終ジャッジ日時 | 2023-09-09 09:21:11 |
合計ジャッジ時間 | 6,218 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,396 KB |
testcase_01 | AC | 52 ms
50,740 KB |
testcase_02 | AC | 54 ms
50,728 KB |
testcase_03 | AC | 54 ms
50,612 KB |
testcase_04 | AC | 51 ms
50,840 KB |
testcase_05 | AC | 53 ms
50,748 KB |
testcase_06 | AC | 55 ms
50,604 KB |
testcase_07 | AC | 54 ms
50,928 KB |
testcase_08 | AC | 56 ms
50,600 KB |
testcase_09 | AC | 77 ms
52,560 KB |
testcase_10 | AC | 87 ms
52,904 KB |
testcase_11 | AC | 70 ms
52,588 KB |
testcase_12 | AC | 85 ms
52,572 KB |
testcase_13 | AC | 114 ms
53,780 KB |
testcase_14 | AC | 197 ms
56,488 KB |
testcase_15 | AC | 121 ms
53,896 KB |
testcase_16 | AC | 82 ms
52,556 KB |
testcase_17 | AC | 246 ms
60,080 KB |
testcase_18 | AC | 244 ms
58,744 KB |
testcase_19 | AC | 169 ms
56,144 KB |
testcase_20 | AC | 168 ms
54,892 KB |
testcase_21 | AC | 141 ms
54,040 KB |
testcase_22 | AC | 252 ms
59,776 KB |
testcase_23 | AC | 67 ms
52,732 KB |
ソースコード
import java.io.BufferedReader; import java.io.Closeable; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.HashSet; import java.util.LinkedList; import java.util.ListIterator; import java.util.Map.Entry; import java.util.PriorityQueue; import java.util.Scanner; import java.util.StringTokenizer; import java.util.TreeMap; import java.util.TreeSet; public class Main { public static void main(String[] args) throws IOException { try (Scanner sc = new Scanner(System.in)) { final int N = sc.nextInt(); int[] as = new int[N]; int[] bs = new int[N]; for(int i = 0; i < N; i++){ as[i] = sc.nextInt(); bs[i] = sc.nextInt(); } final int M = sc.nextInt(); int[] xs = new int[M]; int[] ys = new int[M]; for(int i = 0; i < M; i++){ xs[i] = sc.nextInt(); ys[i] = sc.nextInt(); } int[] count = new int[M]; for(int i = 0; i < M; i++){ for(int j = 0; j < N; j++){ if(xs[i] <= as[j] && ys[i] >= bs[j]){ count[i]++; } } } final int max = Arrays.stream(count).max().getAsInt(); //System.out.println(Arrays.toString(count)); if(max == 0){ System.out.println(0); return; } for(int i = 0; i < M; i++){ if(count[i] == max){ System.out.println((i + 1)); } } } } public static class Scanner implements Closeable { private BufferedReader br; private StringTokenizer tok; public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is)); } private void getLine() throws IOException { while (!hasNext()) { tok = new StringTokenizer(br.readLine()); } } private boolean hasNext() { return tok != null && tok.hasMoreTokens(); } public String next() throws IOException { getLine(); return tok.nextToken(); } public int nextInt() throws IOException { return Integer.parseInt(next()); } public long nextLong() throws IOException { return Long.parseLong(next()); } public double nextDouble() throws IOException { return Double.parseDouble(next()); } public int[] nextIntArray(int n) throws IOException { final int[] ret = new int[n]; for (int i = 0; i < n; i++) { ret[i] = this.nextInt(); } return ret; } public long[] nextLongArray(int n) throws IOException { final long[] ret = new long[n]; for (int i = 0; i < n; i++) { ret[i] = this.nextLong(); } return ret; } public void close() throws IOException { br.close(); } } }