#349887 (D) No.540 格子点と経路

• 問題: No.540 格子点と経路
• ユーザー: 👑 hos.lyric
• 提出日時: 2019-06-03 05:06:11
• 言語: D (dmd 2.109.1)
• 結果: AC
• 実行時間: 1 ms / 2,000 ms
• コード長: 4,321 bytes
• コンパイル時間: 633 ms
• コンパイル使用メモリ: 120,628 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 01:31:54
• 合計ジャッジ時間: 1,428 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 21

ソースコード

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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
/*
     0  1  2  3  4  5  6  7
   +-----------------------
  0| 0  1  1  1  1  1  1  1
  1| 1  3  5  7  9 11 13 15
  2| 1  5  6  9 11 13
  3| 1  7  9 13 17
*/
long solve(long m, long n) {
  if (m > n) {
    swap(m, n);
  }
  if (m == n) {
    if (m % 2 == 0) {
      return m * m + m;
    } else {
      return m * m + m + 1;
    }
  } else {
    if (m % 2 == 0) {
      if (n % 2 == 0) {
        return m * n + m + 1;
      } else {
        return m * n + m + 1;
      }
    } else {
      if (n % 2 == 0) {
        return m * n + n + 1;
      } else {
        return m * n + n + 1;
      }
    }
  }
}
void main() {
  debug {
    foreach (m; 0 .. 8) {
      foreach (n; 0 .. 8) {
        writef("%2d ", solve(m, n));
      }
      writeln();
    }
    return;
  }
  
  debug {
    foreach (m; 1 .. 9) foreach (n; 1 .. 9) {
      if (m * n <= 20) {
        auto dp = new int[][][](1 << (m * n), m * n, 2);
        foreach (p; 0 .. 1 << (m * n)) {
          foreach (z; 0 .. m * n) {
            dp[p][z][] = -1;
          }
        }
        foreach (z; 0 .. m * n) {
          dp[1 << z][z][] = 0;
        }
        foreach (p; 0 .. 1 << (m * n)) {
          foreach (z; 0 .. m * n) {
            foreach (s; 0 .. 2) {
              if (dp[p][z][0] >= 0) {
                const y = z % n;
                {
                  int q = p;
                  foreach (x; z / n + 1 .. m) {
                    if ((p >> (x * n + y)) & 1) {
                      break;
                    }
                    q |= 1 << (x * n + y);
                    chmax(dp[q][x * n + y][1], dp[p][z][0] + 1);
                  }
                }
                {
                  int q = p;
                  foreach_reverse (x; 0 .. z / n) {
                    if ((p >> (x * n + y)) & 1) {
                      break;
                    }
                    q |= 1 << (x * n + y);
                    chmax(dp[q][x * n + y][1], dp[p][z][0] + 1);
                  }
                }
              }
              if (dp[p][z][1] >= 0) {
                const x = z / n;
                {
                  int q = p;
                  foreach (y; z % n + 1 .. n) {
                    if ((p >> (x * n + y)) & 1) {
                      break;
                    }
                    q |= 1 << (x * n + y);
                    chmax(dp[q][x * n + y][0], dp[p][z][1] + 1);
                  }
                }
                {
                  int q = p;
                  foreach_reverse (y; 0 .. z % n) {
                    if ((p >> (x * n + y)) & 1) {
                      break;
                    }
                    q |= 1 << (x * n + y);
                    chmax(dp[q][x * n + y][0], dp[p][z][1] + 1);
                  }
                }
              }
            }
          }
        }
        int mx;
        foreach (z; 0 .. m * n) {
          chmax(mx, dp[$ - 1][z].maxElement);
        }
        writeln(m, " ", n, ": ", mx);
        stdout.flush;
      }
    }
    return;
  }
  
  try {
    for (; ; ) {
      const M = readLong();
      const N = readLong();
      const ans = solve(M, N);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX