Submission #3041798

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push


#define MOD 1000000009LL
#define EPS 1e-8

int R, C, K, N;
int r[ 100010 ];
int c[ 100010 ];
int rCnt[ 100010 ];
int cCnt[ 100010 ];
map<int, map<int, bool> > rc;
map<int, vector<int> > rByCnt;
map<int, vector<int> > cByCnt;

int main()
{
	cin >> R >> C >> K >> N;
	REP( i, N )
	{
		cin >> r[ i ] >> c[ i ];
		++rCnt[ r[ i ] ];
		++cCnt[ c[ i ] ];

		if( rc.count( r[ i ] ) == 0 )
		{
			map<int, bool> m;
			m.insert( make_pair( c[ i ], true ) );
			rc.insert( make_pair( r[ i ], m ) );
		}
		else
		{
			rc.at( r[ i ] ).insert( make_pair( c[ i ], true ) );
		}
	}

	for( int i = 1; i <= N; ++i )
	{
		if( rCnt[ i ] > 0 )
		{
			if( rByCnt.count( rCnt[ i ] ) == 0 )
			{
				vector<int> v;
				v.push_back( i );
				rByCnt.insert( make_pair( rCnt[ i ], v ) );
			}
			else
			{
				rByCnt.at( rCnt[ i ] ).push_back( i );
			}
		}
		if( cCnt[ i ] > 0 )
		{
			if( cByCnt.count( cCnt[ i ] ) == 0 )
			{
				vector<int> v;
				v.push_back( i );
				cByCnt.insert( make_pair( cCnt[ i ], v ) );
			}
			else
			{
				cByCnt.at( cCnt[ i ] ).push_back( i );
			}
		}
	}

	int ans = 0;
	for( auto entry : rByCnt )
	{
		int myCnt = entry.first;
		for( auto i : entry.second )
		{
			int oppCnt = K - myCnt;
			if( oppCnt >= 0 && cByCnt.count( oppCnt ) > 0 )
			{
				for( auto j : cByCnt.at( oppCnt ) )
				{
					if( rc.at( i ).count( j ) == 0 )
					{
						// printf( "(%d, %d)\n", i, j );
						++ans;
					}
				}
			}

			++oppCnt;
			if( oppCnt >= 0 && cByCnt.count( oppCnt ) > 0 )
			{
				for( auto j : cByCnt.at( oppCnt ) )
				{
					if( rc.at( i ).count( j ) > 0 )
					{
						// printf( "(%d, %d)\n", i, j );
						++ans;
					}
				}
			}
		}
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result