Submission #169631

---

Source Code Expand

#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;
int a[10][10];
int ve[4][2]={0,1,0,-1,1,0,-1,0};
int main(){
	
	int h,w;
	cin>>h>>w;
	int n;
	vector<pii> vp;
	cin>>n;
	rep(i,n){
		vp.PB(mkp(0,0));
		int q,r;
		cin>>q>>r;
		q--;
		r--;
		vp[i]=mkp(q,r);
	}
	sort(ALL(vp));
	
	int ans=0;
	
	do{
		int tmp=0;
		vector<pii> tp;
		tp=vp;
		rep(i,h){
			rep(j,w){
				a[i][j]=1;
			}
		}
		rep(i,n){
			//cout<<tp[i].F<<" "<<tp[i].S<<endl;
			if(a[tp[i].F][tp[i].S]==1){
				a[tp[i].F][tp[i].S]=0;
				tmp++;
			}
			rep(j,4){
				int x=tp[i].F+ve[j][0],y=tp[i].S+ve[j][1];
				while(a[x][y]==1&&x>=0&&y>=0&&x<h&&y<w){
					tmp++;
					a[x][y]=0;
					x+=ve[j][0];
					y+=ve[j][1];
				}
				//cout<<"xy "<<x<<" "<<y<<endl;
				/*
				if(1){
					x-=ve[j][0];
					y-=ve[j][1];
					while(x!=tp[i].F&&tp[i].S!=y){
						a[x][y]=0;
						tmp++;
						x-=ve[j][0];
						y-=ve[j][1];
					}
				}
				*/
			}
		}
		/*
		rep(i,h){
			rep(j,w){
				cout<<a[i][j]<<" ";
			}
			cout<<endl;
		}
		cout<<endl;
		*/
		ans=max(ans,tmp);
	}while(next_permutation(ALL(vp)));
	
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result