Submission #402383

---

Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;

class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;

    void calc()
    {
        cin = new Scanner();
        int R = cin.nextInt();
        int C = cin.nextInt();
        int K = cin.nextInt();
        int N = cin.nextInt();
        int[] r = new int[N];
        int[] c = new int[N];
        for (int i = 0; i < N; i++)
        {
            r[i] = cin.nextInt() - 1;
            c[i] = cin.nextInt() - 1;
        }

        //i行目にいくつ、j列目にいくつあるかカウント
        int[] rcount = new int[R];
        int[] ccount = new int[C];
        for (int i = 0; i < N; i++)
        {
            rcount[r[i]]++;
            ccount[c[i]]++;
        }

        //i個獲得できる行がいくつか、j個獲得できる列がいくつか
        int[] rnum = new int[N + 1];
        int[] cnum = new int[N + 1];
        for (int i = 0; i < R; i++)
        {
            rnum[rcount[i]]++;
        }
        for (int i = 0; i < C; i++)
        {
            cnum[ccount[i]]++;
        }

        //組み合わせの掛け算
        long ans = 0;
        for (int i = 0; i <= K; i++)
        {
            ans += rnum[i] * cnum[K - i];
        }

        //ルール変更の際のずれを修正
        for (int i = 0; i < N; i++)
        {
            int count = rcount[r[i]] + ccount[c[i]];
            if (count == K) ans--;
            if (count == K + 1) ans++;
        }
        Console.WriteLine(ans);
    }
}





class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}

Submission Info

Judge Result