Submission #2228080


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long int

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int R, C, K;
    cin >> R >> C >> K;
    int N; cin >> N;
    int r[N], c[N];
    vector<int> cntr(R+1);
    vector<int> cntc(C+1);
    vector<int> amer(N+1);
    vector<int> amec(N+1);
    int ans = 0;
    rep(i, N) {
        cin >> r[i] >> c[i];
        cntr[--r[i]]++; cntc[--c[i]]++;
    }
    /*
    rep(i, R) cout << cntr[i] << " ";
    cout << '\n';
    rep(i, C) cout << cntc[i] << " ";
    cout << '\n';
    //*/
    rep(i, R)  amer[cntr[i]]++;
    rep(i, C)  amec[cntc[i]]++;
    /*
    cout << '\n';
    rep(i, K+1) cout << amer[i] << " ";
    cout << '\n';
    rep(i, K+1) cout << amec[i] << " ";
    cout << '\n';
    //*/
    rep(i, K+1) {
        ans += amer[i] * amec[K-i];
    }
    rep(i, N) {
        if (cntr[r[i]] + cntc[c[i]] == K) ans--;
        if (cntr[r[i]] + cntc[c[i]] == K+1) ans++;
    }
    cout << ans << endl;
    


    return 0;
}

Submission Info

Submission Time
Task C - 収集王
User toame
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1420 Byte
Status AC
Exec Time 20 ms
Memory 4992 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 18
AC × 33
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 1 ms 256 KB
subtask0-sample02.txt AC 1 ms 256 KB
subtask0-sample03.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask2-01.txt AC 1 ms 256 KB
subtask2-02.txt AC 2 ms 384 KB
subtask2-03.txt AC 6 ms 1280 KB
subtask2-04.txt AC 16 ms 4224 KB
subtask2-05.txt AC 18 ms 4224 KB
subtask2-06.txt AC 20 ms 4992 KB
subtask2-07.txt AC 16 ms 3456 KB
subtask2-08.txt AC 20 ms 4992 KB
subtask2-09.txt AC 20 ms 4992 KB
subtask2-10.txt AC 20 ms 4992 KB
subtask2-11.txt AC 20 ms 4992 KB
subtask2-12.txt AC 20 ms 4992 KB
subtask2-13.txt AC 20 ms 4992 KB
subtask2-14.txt AC 20 ms 4992 KB
subtask2-15.txt AC 20 ms 4992 KB