Submission #2215194

---

Source Code Expand

#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <random>
#include <utility>
#include <cmath>
#include <string.h>
#include <iomanip>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする
 
struct edge{int to,cost;};
vector<int> G[100005];
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
 
std::vector<P> tree[100010];
ll i,j,p;

ll r,c,k,n;
ll a,b,y,ans=0;
ll ro[100005],co[100005],rcount[100005],ccount[100005],rn[100005],cn[100005];

int main(){
	cin>>r>>c>>k>>n;
	memset(ro,0,sizeof(ro));
	memset(co,0,sizeof(co));
	memset(rcount,0,sizeof(rcount));
	memset(ccount,0,sizeof(ccount));
	memset(rn,0,sizeof(rn));
	memset(cn,0,sizeof(cn));
	for(i=1;i<=n;i++){
		cin>>rn[i]>>cn[i];
		ro[rn[i]]++;
		co[cn[i]]++;
	}
	for(i=1;i<=r;i++){
		rcount[ro[i]]++;
	}
	for(i=1;i<=c;i++){
		ccount[co[i]]++;
	}
	for(i=0;i<=k;i++){
		ans += rcount[i]*ccount[k-i];
	}

	for(i=1;i<=n;i++){
		if(ro[rn[i]]+co[cn[i]]==k)ans--;
		if(ro[rn[i]]+co[cn[i]]==k+1)ans++;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result