4 4 2 1 1 1 2 5 5 8 0 0 1 0 1 1 2 0 2 3 3 1 3 2 4 0
8 9
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib> 10 #include <string> 11 #include <set> 12 #include <stack> 13 #define LL long long 14 #define pii pair<int,int> 15 #define INF 0x3f3f3f3f 16 using namespace std; 17 int n,m,k,ans; 18 int mp[10][10]; 19 void dfs(int cur,int has){ 20 int x = cur/m; 21 int y = cur%m; 22 if(has > ans) ans = has; 23 if(cur == n*m) return; 24 if(mp[x][y]) {dfs(cur+1,has);return;} 25 dfs(cur+1,has); 26 int i,cnt = 0; 27 for(i = x-1; i >= 0; i--){ 28 if(mp[i][y]) cnt++; 29 if(cnt == 2) break; 30 } 31 if(cnt == 2 && mp[i][y] == 2) return; 32 cnt = 0; 33 for(i = y-1; i >= 0; i--){ 34 if(mp[x][i]) cnt++; 35 if(cnt == 2) break; 36 } 37 if(cnt == 2 && mp[x][i] == 2) return; 38 mp[x][y] = 2; 39 dfs(cur+1,has+1); 40 mp[x][y] = 0; 41 } 42 int main() { 43 int i,j,x,y; 44 while(~scanf("%d %d %d",&n,&m,&k)){ 45 memset(mp,0,sizeof(mp)); 46 for(i = 0; i < k; i++){ 47 scanf("%d %d",&x,&y); 48 mp[x][y] = 1; 49 } 50 ans = 0; 51 dfs(0,0); 52 printf("%d\n",ans); 53 } 54 return 0; 55 }