結果

問題 No.11 カードマッチ
ユーザー yuya178yuya178
提出日時 2017-11-22 02:09:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 74 ms / 5,000 ms
コード長 4,275 bytes
コンパイル時間 5,166 ms
コンパイル使用メモリ 88,272 KB
実行使用メモリ 52,832 KB
最終ジャッジ日時 2023-08-17 12:00:35
合計ジャッジ時間 4,764 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,268 KB
testcase_01 AC 44 ms
49,312 KB
testcase_02 AC 42 ms
49,488 KB
testcase_03 AC 42 ms
49,072 KB
testcase_04 AC 58 ms
50,268 KB
testcase_05 AC 41 ms
47,676 KB
testcase_06 AC 60 ms
52,780 KB
testcase_07 AC 58 ms
50,344 KB
testcase_08 AC 59 ms
50,688 KB
testcase_09 AC 67 ms
52,832 KB
testcase_10 AC 65 ms
50,956 KB
testcase_11 AC 74 ms
50,776 KB
testcase_12 AC 68 ms
48,884 KB
testcase_13 AC 61 ms
50,600 KB
testcase_14 AC 58 ms
50,520 KB
testcase_15 AC 44 ms
49,332 KB
testcase_16 AC 45 ms
49,284 KB
testcase_17 AC 44 ms
49,348 KB
testcase_18 AC 45 ms
49,452 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int w = ni();
        int h = ni();
        int n = ni();
        int[] s = new int[n];
        int[] k = new int[n];
        for(int i = 0; i < n; i++){
            s[i] = ni()-1;
            k[i] = ni()-1;
        }
        boolean[] wb = new boolean[w];
        boolean[] hb = new boolean[h];
        for(int i = 0; i < n; i++){
            wb[s[i]] = true;
            hb[k[i]] = true;
        }
        long sum = 0;
        for(int i = 0; i < w; i++){
            if(!wb[i]) sum++;
        }
        long sum2 = 0;
        for(int i = 0; i < h; i++){
            if(!hb[i]) sum2++;
        }
        out.println((long)w*h - (long)sum*sum2-n);
    }
   
    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, 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 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0