HDU 3657 Game

Game

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 575 Accepted Submission(s): 242

Problem Description

onmylove has invented a game on n × m grids. There is one positive integer on each grid. Now you can take the numbers from the grids to make your final score as high as possible. The way to get score is like
the following:
● At the beginning, the score is 0;
● If you take a number which equals to x, the score increase x;
● If there appears two neighboring empty grids after you taken the number, then the score should be decreased by 2(x&y). Here x and y are the values used to existed on these two grids. Please pay attention that "neighboring grids" means there exits and only exits one common border between these two grids.

Since onmylove thinks this problem is too easy, he adds one more rule:
● Before you start the game, you are given some positions and the numbers on these positions must be taken away.
Can you help onmylove to calculate: what's the highest score onmylove can get in the game?

Input

Multiple input cases. For each case, there are three integers n, m, k in a line.
n and m describing the size of the grids is n ×m. k means there are k positions of which you must take their numbers. Then following n lines, each contains m numbers, representing the numbers on the n×m grids.Then k lines follow. Each line contains two integers, representing the row and column of one position
and you must take the number on this position. Also, the rows and columns are counted start from 1.
Limits: 1 ≤ n, m ≤ 50, 0 ≤ k ≤ n × m, the integer in every gird is not more than 1000.

Output

For each test case, output the highest score on one line.

Sample Input

  
  

   
   2 2 1
2 2
2 2
1 1
2 2 1
2 7
4 1
1 1
  
  

Sample Output

  
  

   
   4
9


   
   

    
    

     
     Hint
    
    
As to the second case in Sample Input, onmylove gan get the highest score when calulating like this:
2 + 7 + 4 － 2 × (2&4) － 2 × (2&7) = 13 － 2 × 0 － 2 × 2 = 9.
   
   
   
    
  
  

Author

onmylove

Source

2010 Asia Regional Chengdu Site —— Online Contest

Recommend

lcy

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>

#define INT_INF 0x3fffffff
#define LL_INF 0x3fffffffffffffff
#define EPS 1e-12
#define MOD 1000000007
#define PI 3.141592653579798
#define N 3000
#define E 30000

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef double DB;

const int zl[4][2]={{1,0},{-1,0},{0,1},{0,-1}};

struct Edge
{
    int en,cap,flow,next;
} edge[E];
int head[N] , tot , now[N];
int source,sink,tot_num;
int pre[N] , dis[N] , gap[N];

void add_edge(int st,int en,int cap)
{
    edge[tot].en=en;
    edge[tot].cap=cap;
    edge[tot].flow=0;
    edge[tot].next=head[st];
    head[st]=tot++;

    edge[tot].en=st;
    edge[tot].cap=0;
    edge[tot].flow=0;
    edge[tot].next=head[en];
    head[en]=tot++;
}

void augment(int flow)
{
    for(int i=source;i!=sink;i=edge[now[i]].en)
    {
        edge[now[i]].flow+=flow;
        edge[now[i]^1].flow-=flow;
    }
}

int sap()
{
    memset(dis,0,sizeof(dis));
    memset(gap,0,sizeof(gap));
    memset(pre,-1,sizeof(pre));
    for(int i=0;i<tot_num;i++)
        now[i]=head[i];
    gap[0]=tot_num;
    int point=source,flow=0,min_flow=INT_INF;
    while(dis[source]<tot_num)
    {
        bool fg=false;
        for(int i=now[point];i!=-1;i=edge[i].next)
            if(edge[i].cap-edge[i].flow>0 && dis[point]==dis[edge[i].en]+1)
            {
                min_flow=min(min_flow,edge[i].cap-edge[i].flow);
                now[point]=i;
                pre[edge[i].en]=point;
                point=edge[i].en;
                if(point==sink)
                {
                    flow+=min_flow;
                    augment(min_flow);
                    point=source;
                    min_flow=INT_INF;
                }
                fg=true;
                break;
            }
        if(fg) continue;
        if(--gap[dis[point]]==0) break;
        int Min=tot_num;
        for(int i=head[point];i!=-1;i=edge[i].next)
            if(edge[i].cap-edge[i].flow>0 && Min>dis[edge[i].en])
            {
                Min=dis[edge[i].en];
                now[point]=i;
            }
        gap[dis[point]=Min+1]++;
        if(point!=source) point=pre[point];
    }
    return flow;
}

int g[55][55];
vector<int> pos;

int build(int n,int m,int k)
{
    int cnt=0;
    memset(head,-1,sizeof(head));
    tot=0;
    source=N-2; sink=N-1; tot_num=N;
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
        {
            scanf("%d",&g[i][j]);
            cnt+=g[i][j];
        }
    pos.clear();
    for(int i=0,x,y; i<k; i++)
    {
        scanf("%d%d",&x,&y);
        x--; y--;
        pos.push_back(x*m+y);
    }
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
        {
            if((i+j)%2==0)
            {
                add_edge(source,i*m+j,g[i][j]);
                for(int p=0; p<4; p++)
                    if(i+zl[p][0]>=0 && i+zl[p][0]<n && j+zl[p][1]>=0 && j+zl[p][1]<m)
                        add_edge(i*m+j,(i+zl[p][0])*m+j+zl[p][1],2*(g[i][j]&g[i+zl[p][0]][j+zl[p][1]]));
            }
            else add_edge(i*m+j,sink,g[i][j]);
        }
    for(int i=0; i<(int)pos.size(); i++)
    {
        int x=pos[i]/m;
        int y=pos[i]%m;
        if((x+y)%2==0) add_edge(source,pos[i],INT_INF);
        else add_edge(pos[i],sink,INT_INF);
    }
    return cnt;
}

int main()
{
    int n,m,k;
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        int ans=build(n,m,k);
        ans-=sap();
        printf("%d\n",ans);
    }
    return 0;
}