提出 #71873273

---

ソースコード 拡げる

import java.util.Scanner;
import java.util.HashSet;
import java.util.InputMismatchException;

public class Main {

    public static void main(String[] args) {
        try (Scanner scanner = new Scanner(System.in)) {
            if (!scanner.hasNextInt()) {
                return;
            }
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            int N = scanner.nextInt();

            int[][] grid = new int[H][W];
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (!scanner.hasNextInt()) {
                        return;
                    }
                    grid[i][j] = scanner.nextInt();
                }
            }

            HashSet<Integer> calledOutNumbers = new HashSet<>();
            for (int k = 0; k < N; k++) {
                if (!scanner.hasNextInt()) {
                    return;
                }
                calledOutNumbers.add(scanner.nextInt());
            }

            int maxCalledOut = 0;

            for (int i = 0; i < H; i++) {
                int currentCount = 0;
                
                for (int j = 0; j < W; j++) {
                    int number = grid[i][j];
                    
                    if (calledOutNumbers.contains(number)) {
                        currentCount++;
                    }
                }

                if (currentCount > maxCalledOut) {
                    maxCalledOut = currentCount;
                }
            }

            System.out.println(maxCalledOut);

        } catch (InputMismatchException e) {
            
        } catch (Exception e) {
            
        }
    }
}

提出情報

ジャッジ結果