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
| #include <bits/stdc++.h> using namespace std; namespace Legendgod { namespace Read {
#ifdef Fread const int Siz = (1 << 21) + 5; char *iS, *iT, buf[Siz]; #define gc() ( iS == iT ? (iT = (iS = buf) + fread(buf, 1, Siz, stdin), iS == iT ? EOF : *iS ++) : *iS ++ ) #define getchar gc #endif template <typename T> void r1(T &x) { x = 0; char c(getchar()); int f(1); for(; !isdigit(c); c = getchar()) if(c == '-') f = -1; for(; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48); x *= f; } template <typename T, typename...Args> void r1(T &x, Args&...arg) { r1(x), r1(arg...); } #undef getchar }
using namespace Read;
const int maxn = 2e5 + 5; typedef long long int64; int n, m, a[5][maxn]; const int N = 2e5 + 3; struct Seg { int64 t[maxn << 2]; int lowbit(int x) { return x & -x; } void add(int p,int c) { for(; p <= 2 * N; p += lowbit(p)) t[p] += c; } int64 ask(int p) { int64 res(0); for(; p > 0; p -= lowbit(p)) res += t[p]; return res; } void clear() { for(int i = 0; i <= 2 * N; ++ i) t[i] = 0; } }T;
int64 S2(int x,int y) { if(x > m || y > m) return 0; int64 res(0); T.clear(); for(int i = 1; i <= m; ++ i) { int tmp = a[x][i] - a[y][i]; T.add(N - tmp, 1); } for(int i = 1; i <= m; ++ i) { int tmp = a[x][i] - a[y][i]; res += T.ask(N + tmp) * a[x][i]; } T.clear(); for(int i = 1; i <= m; ++ i) { int tmp = a[y][i] - a[x][i]; T.add(N - tmp, 1); } for(int i = 1; i <= m; ++ i) { int tmp = a[y][i] - a[x][i]; res += T.ask(N + tmp - 1) * a[y][i]; } auto Force = [&]() -> int64{ int64 rs(0); for(int i = 1; i <= m; ++ i) for(int j = 1; j <= m; ++ j) { rs += max(a[x][i] + a[x][j], a[y][i] + a[y][j]); } return rs; }; return res * 2; }
struct Node { int x[2], val, id; int operator < (const Node& z) { return x[0] < z.x[0] || (x[0] == z.x[0] && id < z.id); } }v[maxn << 1];
int64 S3(int x,int y,int z) { if(x > n || y > n || z > n) return 0; vector<int> vc; vc.emplace_back(0), vc.emplace_back(x), vc.emplace_back(y), vc.emplace_back(z); int64 res(0); for(int k = 1; k <= 3; ++ k) { for(int i = 1; i <= m; ++ i) { v[i].id = i; v[i].val = a[vc[k]][i]; v[i + m].id = 0, v[i + m].val = a[vc[k]][i]; for(int s = 1, ed = 0; s <= 3; ++ s) if(s != k) { v[i].x[ed ++] = a[vc[k]][i] - a[vc[s]][i]; v[i + m].x[ed - 1] = a[vc[s]][i] - a[vc[k]][i] + (s < k); } } sort(v + 1, v + 2 * m + 1), T.clear(); for(int i = 1; i <= 2* m; ++ i) { if(v[i].id != 0) res += v[i].val * T.ask(N + v[i].x[1]); else T.add(N + v[i].x[1], 1); } } return res * 2; }
signed main() { int i, j; int64 ans(0); r1(n, m); for(i = 1; i <= n; ++ i) for(j = 1; j <= m; ++ j) r1(a[i][j]), ans += a[i][j] * 2ll * m; if(n == 4) { ans -= S2(1, 2) + S2(1, 3) + S2(1, 4) + S2(2, 3) + S2(2, 4) + S2(3, 4); ans += S3(1, 2, 3) + S3(1, 2, 4) + S3(1, 3, 4) + S3(2, 3, 4); } if(n == 3) { ans = S3(1, 2, 3); for(i = 1; i <= n; ++ i) for(j = 1; j <= m; ++ j) a[i][j] = N - 1 - a[i][j]; ans += - S3(1, 2, 3) + 2ll * m * m * (N-1); } printf("%lld\n", ans); return 0; }
}
signed main() { return Legendgod::main(), 0; }
|