#137680 (C++11（廃止可能性あり）) No.460 裏表ちわーわ

• 問題: No.460 裏表ちわーわ
• ユーザー: tnakao0123
• 提出日時: 2016-12-11 23:34:27
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 1,937 bytes
• コンパイル時間: 627 ms
• コンパイル使用メモリ: 84,912 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-11-29 04:05:41
• 合計ジャッジ時間: 1,661 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/* -*- coding: utf-8 -*-
 *
 * 460.cc: No.460 裏表ちわーわ - yukicoder
 */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;
/* constant */
const int MAX_H = 8;
const int MAX_W = 8;
const int WBITS = 1 << MAX_W;
const int INF = 1 << 30;
/* typedef */
/* global variables */
int h, w, wbits;
int bds[MAX_H];
int msks[MAX_W], mbits[WBITS], bnums[WBITS];
int minc;
/* subroutines */
inline int xy2p(int x, int y) { return y * w + x; }
void rec(int y, int c) {
  if (y >= h) {
    if (bds[h - 1] == 0 && minc > c) minc = c;
    return;
  }
  for (int bits = 0; bits < wbits; bits++)
    if (bds[y - 1] == mbits[bits]) {
      bds[y] ^= mbits[bits];
      if (y < h - 1) bds[y + 1] ^= mbits[bits];
      rec(y + 1, c + bnums[bits]);
      if (y < h - 1) bds[y + 1] ^= mbits[bits];
      bds[y] ^= mbits[bits];
    }
}
/* main */
int main() {
  cin >> h >> w;
  wbits = 1 << w;
  
  for (int y = 0; y < h; y++)
    for (int x = 0, bi = 1; x < w; x++, bi <<= 1) {
      int a;
      cin >> a;
      if (a) bds[y] |= bi;
    }
  for (int x = 0, bi = 1; x < w; x++, bi <<= 1) {
    msks[x] = bi;
    if (x > 0) msks[x] |= (bi >> 1);
    if (x < w - 1) msks[x] |= (bi << 1);
  }
  for (int bits = 0; bits < wbits; bits++) {
    mbits[bits] = bnums[bits] = 0;
    for (int x = 0, bi = 1; x < w; x++, bi <<= 1)
      if (bits & bi) mbits[bits] ^= msks[x], bnums[bits]++;
  }
  minc = INF;
  for (int bits = 0; bits < wbits; bits++) {
    bds[0] ^= mbits[bits]; bds[1] ^= mbits[bits];
    rec(1, bnums[bits]);
    bds[0] ^= mbits[bits]; bds[1] ^= mbits[bits];
  }
  if (minc >= INF) puts("Impossible");
  else printf("%d\n", minc);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX