Submission #2214564

---

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];

int main(){
	cin>>r>>c>>k>>n;
	memset(ro,0,sizeof(ro));
	memset(co,0,sizeof(co));
	for(i=1;i<=n;i++){
		cin>>a>>b;
		ro[a]++;
		co[b]++;
		G[a].push_back(b);
	}
	for(i=1;i<=r;i++){
		for(j=1;j<=c;j++){
			y=0;
			for(p=0;p<G[i].size();p++){
				if(G[i][p]==j)y=1;
			}
			if(ro[i]+co[j]-y==k)ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result