Fliptile poj 3279 switch Problem

Fliptile poj 3279 switch Problem

Language:DefaultFliptile Time Limit:2000 MS Memory Limit:65536 K Total Submissions:3821 Accepted:1461 Description Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulateM×NGrid (1 ≤M≤ 15; 1 ≤N≤ 15) of square tiles, each of which is colored black on one side and white on the other side. As one wocould guess, when a single white tile is flipped, it changes to black; when a single black tile is flipped, it changes to white. the cows are rewarded when they flip the tiles so that each tile has the white side face up. however, the cows have rather large hooves and when they try to flip a certain tile, they also flip all the adjacent tiles (tiles that share a full edge with the flipped tile ). since the flips are tiring, the cows want to minimize the number of flips they have to make. Help the cows determine the minimum number of flips required, and the locations to flip to achieve that minimum. if there are multiple ways to achieve the task with the minimum amount of flips, return the one with the least lexicographical ordering in the output when considered as a string. if the task is impossible, print one line with the word "IMPOSSIBLE ". Input Line 1: Two space-separated integers:MAndN Lines 2 ..M+ 1: LineI+ 1 describes the colors (left to right) of row I of the gridNSpace-separated integers which are 1 for black and 0 for white Output Lines 1 ..M: Each line containsNSpace-separated integers, each specifying how many times to flip that participant location. Sample Input 4 41 0 0 10 1 1 00 1 1 01 0 0 1 Sample Output 0 0 0 01 0 0 11 0 0 10 0 0 0 Source USACO 2007 Open Silver

To give a 0, 1 matrix of m * n, perform a flip operation. Turning over the four adjacent grids around a grid will also follow the flip operation. The minimum number of flip requests is required to make all the matrices 0.

Code:

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      # Include
       
         # Include
        
          # Include
         
           # Include
          
            # Pragma comment (linker, "/STACK: 102400000,102400000") # define maxn 20 # define MAXN 2005 # define mod 1000000009 # define INF 0x3f3f3f # define pi acos (-1.0) # define eps 1e-6 # define lson rt <1, l, mid # define rson rt <1 | 1, mid + 1, rtypedef long ll; using namespace std; int dir [5] [2] = {, 0,-1,-,}; int m, n; int a [maxn] [maxn]; int flip [maxn] [maxn]; int ans [maxn] [maxn]; int get (int x, int y) {int c = a [x] [y]; for (int I = 0; I <5; I ++) {int dx = x + dir [I] [0]; int dy = y + dir [I] [1]; if (dx> = 0 & dx
           
             = 0 & dy
            
              > J) & 1; int num = calc (); if (num> = 0 & (res <0 | res> num) {res = num; memcpy (ans, flip, sizeof (flip) ;}} if (res <0) printf ("IMPOSSIBLE \ n"); else {for (int I = 0; I