CodeForces 316c1 Tidying Up

Tidying Up

Time Limit: 4000ms
Memory Limit: 262144KB
This problem will be judged on CodeForces. Original ID: 316C1
64-bit integer IO format: %I64d      Java class name: (Any)

Smart Beaver is careful about his appearance and pays special attention to shoes so he has a huge number of pairs of shoes from the most famous brands of the forest. He's trying to handle his shoes carefully so that each pair stood side by side. But by the end of the week because of his very active lifestyle in his dressing room becomes a mess.

Smart Beaver from ABBYY is not only the brightest beaver in the area, but he also is the most domestically oriented. For example, on Mondays the Smart Beaver cleans everything in his home.

It's Monday morning. Smart Beaver does not want to spend the whole day cleaning, besides, there is much in to do and it’s the gym day, so he wants to clean up as soon as possible. Now the floors are washed, the dust is wiped off — it’s time to clean up in the dressing room. But as soon as the Smart Beaver entered the dressing room, all plans for the day were suddenly destroyed: chaos reigned there and it seemed impossible to handle, even in a week. Give our hero some hope: tell him what is the minimum number of shoes need to change the position to make the dressing room neat.

The dressing room is rectangular and is divided into n × m equal squares, each square contains exactly one shoe. Each pair of shoes has a unique number that is integer from 1 to , more formally, a square with coordinates (i, j) contains an integer number of the pair which is lying on it. The Smart Beaver believes that the dressing room is neat only when each pair of sneakers lies together. We assume that the pair of sneakers in squares (i1, j1) and (i2, j2) lies together if |i1 - i2| + |j1 - j2| = 1.

 

Input

The first line contains two space-separated integers n and m. They correspond to the dressing room size. Next n lines contain m space-separated integers each. Those numbers describe the dressing room. Each number corresponds to a snicker.

It is guaranteed that:

  • n·m is even.
  • All numbers, corresponding to the numbers of pairs of shoes in the dressing room, will lie between 1 and .
  • Each number from 1 to  will occur exactly twice.

The input limits for scoring 30 points are (subproblem C1):

  • 2 ≤ n, m ≤ 8.

The input limits for scoring 100 points are (subproblems C1+C2):

  • 2 ≤ n, m ≤ 80.
 

Output

Print exactly one integer — the minimum number of the sneakers that need to change their location.

 

Sample Input

Input
2 3
1 1 2
2 3 3
Output
2
Input
3 4
1 3 2 6
2 1 5 6
4 4 5 3
Output
4

Source

ABBYY Cup 3.0
 
解题：最小费用最大流
 
 1 #include <bits/stdc++.h>
 2 #define INF 0x3f3f3f3f
 3 const int maxn = 100010;
 4 using namespace std;
 5 struct arc {
 6     int to,flow,next;
 7     int cost;
 8     arc(int x = 0,int y = 0,int z = 0,int nxt = -1) {
 9         to = x;
10         flow = y;
11         cost = z;
12         next = nxt;
13     }
14 };
15 int head[maxn],tot,p[maxn],d[maxn];
16 arc e[1000010];
17 bool in[maxn];
18 void add(int u,int v,int flow,int cost) {
19     e[tot] = arc(v,flow,cost,head[u]);
20     head[u] = tot++;
21     e[tot] = arc(u,0,-cost,head[v]);
22     head[v] = tot++;
23 }
24 bool spfa(int S,int T) {
25     for(int i = 0; i < maxn; i++) {
26         p[i] = -1;
27         d[i] = INF;
28         in[i] = false;
29     }
30     d[S] = 0;
31     queue<int>q;
32     q.push(S);
33     while(!q.empty()) {
34         int u = q.front();
35         q.pop();
36         in[u] = false;
37         for(int i = head[u]; ~i; i = e[i].next) {
38             if(e[i].flow && d[e[i].to] > d[u] + e[i].cost) {
39                 d[e[i].to] = d[u] + e[i].cost;
40                 p[e[i].to] = i;
41                 if(!in[e[i].to]) {
42                     q.push(e[i].to);
43                     in[e[i].to] = true;
44                 }
45             }
46         }
47     }
48     return p[T] > -1;
49 }
50 
51 int calc(int S,int T) {
52     int tmp = 0,mxV;
53     while(spfa(S,T)) {
54         mxV = INF;
55         for(int i = p[T]; ~i; i = p[e[i^1].to])
56             mxV = min(mxV,e[i].flow);
57         for(int i = p[T]; ~i; i = p[e[i^1].to]) {
58             e[i].flow -= mxV;
59             e[i^1].flow += mxV;
60             tmp += e[i].cost*mxV;
61         }
62     }
63     return tmp;
64 }
65 int mp[120][120];
66 int main() {
67     int n,m,S,T;
68     while(~scanf("%d%d",&n,&m)) {
69         memset(head,-1,sizeof head);
70         for(int i = tot = 0; i < n; ++i)
71             for(int j = 0; j < m; ++j) {
72                 scanf("%d",mp[i]+j);
73             }
74         S = n*m;
75         T = S + 1;
76         for(int i = 0; i < n; ++i)
77             for(int j = 0; j < m; ++j) {
78                 if((i+j)&1) {
79                     add(S,i*m+j,1,0);
80                     if(i) add(i*m+j,(i-1)*m+j,1,mp[i][j] != mp[i-1][j]);
81                     if(j) add(i*m+j,i*m+j-1,1,mp[i][j] != mp[i][j-1]);
82                     if(i+1 < n)
83                         add(i*m+j,(i+1)*m+j,1,mp[i][j] != mp[i+1][j]);
84                     if(j+1 < m)
85                         add(i*m+j,i*m+j+1,1,mp[i][j] != mp[i][j+1]);
86                 } else add(i*m+j,T,1,0);
87             }
88         printf("%d\n",calc(S,T));
89     }
90     return 0;
91 }
View Code

 

posted @ 2015-07-19 20:52  狂徒归来  阅读(327)  评论(0)  编辑  收藏  举报