結果
問題 | No.647 明太子 |
ユーザー | uwi |
提出日時 | 2018-02-09 22:24:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 143 ms / 4,500 ms |
コード長 | 3,548 bytes |
コンパイル時間 | 5,068 ms |
コンパイル使用メモリ | 76,636 KB |
実行使用メモリ | 53,848 KB |
最終ジャッジ日時 | 2023-09-09 09:20:38 |
合計ジャッジ時間 | 7,457 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,140 KB |
testcase_01 | AC | 43 ms
49,496 KB |
testcase_02 | AC | 43 ms
49,132 KB |
testcase_03 | AC | 43 ms
49,480 KB |
testcase_04 | AC | 43 ms
49,444 KB |
testcase_05 | AC | 44 ms
49,136 KB |
testcase_06 | AC | 43 ms
49,464 KB |
testcase_07 | AC | 44 ms
47,480 KB |
testcase_08 | AC | 44 ms
49,428 KB |
testcase_09 | AC | 49 ms
49,188 KB |
testcase_10 | AC | 55 ms
50,224 KB |
testcase_11 | AC | 46 ms
49,304 KB |
testcase_12 | AC | 52 ms
50,080 KB |
testcase_13 | AC | 64 ms
51,976 KB |
testcase_14 | AC | 123 ms
53,168 KB |
testcase_15 | AC | 81 ms
52,816 KB |
testcase_16 | AC | 51 ms
49,876 KB |
testcase_17 | AC | 130 ms
53,152 KB |
testcase_18 | AC | 132 ms
53,196 KB |
testcase_19 | AC | 97 ms
52,672 KB |
testcase_20 | AC | 102 ms
53,196 KB |
testcase_21 | AC | 75 ms
51,956 KB |
testcase_22 | AC | 143 ms
53,848 KB |
testcase_23 | AC | 44 ms
49,132 KB |
ソースコード
package contest180209; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[][] mens = new int[n][]; for(int i = 0;i < n;i++){ mens[i] = na(2); } int m = ni(); int[] fs = new int[m]; for(int i = 0;i < m;i++){ int x = ni(), y = ni(); int f = 0; for(int j = 0;j < n;j++){ if(x <= mens[j][0] && y >= mens[j][1]){ f++; } } fs[i] = f; } int maxf = 1; int x = 0; for(int i = 0;i < m;i++){ maxf = Math.max(maxf, fs[i]); } for(int i = 0;i < m;i++){ if(fs[i] == maxf){ out.println(i+1); x++; } } if(x == 0)out.println(0); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new B().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }