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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 1010
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
ll helperX(vvll& A) {
ll res = 0, n = A.size(), m = A[0].size();
unordered_map<ll, all3> mp;
for(ll i = 0; i < m; i++) {
unordered_map<ll, ll> now;
for(ll j = 0; j < n; j++) {
now[A[j][i]]++;
if(!mp.count(A[j][i])) mp[A[j][i]] = {0, 0, i};
if(mp[A[j][i]][2] != i) {
ll d = i - mp[A[j][i]][2];
mp[A[j][i]][2] = i;
mp[A[j][i]][0] += d * mp[A[j][i]][1];
}
res += mp[A[j][i]][0];
}
for(auto& [k, v] : now) {
mp[k][1] += v;
mp[k][2] = i + 1;
mp[k][0] += mp[k][1];
}
}
return res;
}
ll helperY(vvll& A) {
ll res = 0, n = A.size(), m = A[0].size();
unordered_map<ll, all3> mp;
for(ll i = 0; i < n; i++) {
unordered_map<ll, ll> now;
for(ll j = 0; j < m; j++) {
now[A[i][j]]++;
if(!mp.count(A[i][j])) mp[A[i][j]] = {0, 0, i};
if(mp[A[i][j]][2] != i) {
ll d = i - mp[A[i][j]][2];
mp[A[i][j]][2] = i;
mp[A[i][j]][0] += d * mp[A[i][j]][1];
}
res += mp[A[i][j]][0];
}
for(auto& [k, v] : now) {
mp[k][1] += v;
mp[k][2] = i + 1;
mp[k][0] += mp[k][1];
}
}
return res;
}
ll solve(vvll& A) {
return helperX(A) + helperY(A);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, m;
cin>>n>>m;
vvll A(n,vll(m));
for(ll i = 0; i < n; i++) for(ll j = 0; j < m; j++) cin>>A[i][j];
cout<<solve(A)<<endl;
}
return 0;
}
|
