結果

問題 No.647 明太子
ユーザー uafr_csuafr_cs
提出日時 2018-02-09 22:27:04
言語 Java
(openjdk 23)
結果
AC  
実行時間 267 ms / 4,500 ms
コード長 2,714 bytes
コンパイル時間 2,273 ms
コンパイル使用メモリ 88,980 KB
実行使用メモリ 57,904 KB
最終ジャッジ日時 2024-06-27 02:27:42
合計ジャッジ時間 6,039 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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();
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0