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
| #pragma G++ optimize("O3")
#include <algorithm> #include <cmath> #include <cstdio> #include <ctime> #include <cstring> #include <iostream> #include <queue> #include <map> #include <set> #include <string> #include <list> #include <forward_list> #include <stack> #include <unordered_set> #include <vector> #include <limits.h>
using namespace std; const long long MAX = 2e6 + 7;
long long a[500][500]; long long st[500][500][10]; long long stGCD[500][500][10];
#define qmin(a, b, c, d) min(min(a,b),min(c,d))
long long gcd(long long x, long long y) { if (x == 0) { return y; } return gcd(y % x, x); }
#define qgcd(a, b, c, d) gcd(gcd(a, b), gcd(c, d))
int pow2[10];
long long queryMin(long long midX, long long midY, long long len) { int k = log2(len * 2 + 1); return qmin(st[midX - len][midY - len][k], st[midX - len][midY + len - pow2[k] + 1][k], st[midX + len - pow2[k] + 1][midY - len][k], st[midX + len - pow2[k] + 1][midY + len - pow2[k] + 1][k]); }
long long queryGCD(long long midX, long long midY, long long len) { int k = log2(len * 2 + 1); return qmin(stGCD[midX - len][midY - len][k], stGCD[midX - len][midY + len - pow2[k] + 1][k], stGCD[midX + len - pow2[k] + 1][midY - len][k], stGCD[midX + len - pow2[k] + 1][midY + len - pow2[k] + 1][k]); }
int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; st[i][j][0] = a[i][j]; stGCD[i][j][0] = a[i][j]; } } int len = min(n, m); pow2[0] = 1; for (int k = 1; k < 10; k++) { pow2[k] = pow2[k - 1] * 2; } int log2len = log2(len) + 1; for (int k = 1; k <= log2len; k++) { for (int i = 0; i + pow2[k] <= n; i++) { for (int j = 0; j + pow2[k] <= m; j++) { st[i][j][k] = qmin(st[i][j][k - 1], st[i][j + pow2[k - 1]][k - 1], st[i + pow2[k - 1]][j][k - 1], st[i + pow2[k - 1]][j + pow2[k - 1]][k - 1]); stGCD[i][j][k] = qgcd(stGCD[i][j][k - 1], stGCD[i][j + pow2[k - 1]][k - 1], stGCD[i + pow2[k - 1]][j][k - 1], stGCD[i + pow2[k - 1]][j + pow2[k - 1]][k - 1]); } } } int ans = 0; int count = 1; for (int i = 1; i < n; i++) { for (int j = 1; j < m; j++) { int maxLen = qmin(i, n - i - 1, j, m - j - 1); int l = 1, r = maxLen + 1; while (l < r) { int mid = (l + r) / 2; if (a[i][j] == queryMin(i, j, mid) && a[i][j] == queryGCD(i, j, mid)) { l = mid + 1; } else { r = mid; } } if (l == 1) { continue; } if (ans == l - 1) { count += 1; } else if (l - 1 > ans) { ans = l - 1; count = 1; } } } if (ans == 0) { cout << 1 << endl << n * m << endl; return 0; } cout << (ans * 2 + 1) * (ans * 2 + 1) << endl; cout << count << endl; return 0; }
|