Skip to content

Commit 11a5719

Browse files
committed
Add 18868.cpp
1 parent 64f5003 commit 11a5719

File tree

1 file changed

+36
-0
lines changed

1 file changed

+36
-0
lines changed

18xxx/18868.cpp

+36
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
#include <algorithm>
2+
#include <iostream>
3+
#include <vector>
4+
using namespace std;
5+
6+
bool check(int n, const vector<pair<int, int>> &a, const vector<pair<int, int>> &b) {
7+
for (int i=0; i<n; i++) {
8+
if (a[i].second != b[i].second) return false;
9+
}
10+
return true;
11+
}
12+
13+
void solve(void) {
14+
int m, n; cin >> m >> n;
15+
vector<vector<pair<int, int>>> v(m, vector<pair<int, int>>(n));
16+
for (int i=0; i<m; i++) for (int j=0; j<n; j++) cin >> v[i][j].first, v[i][j].second = j;
17+
18+
for (int i=0; i<m; i++) sort(v[i].begin(), v[i].end());
19+
for (int i=0; i<m; i++) for (int j=1; j<n; j++) {
20+
if (v[i][j].first == v[i][j-1].first) v[i][j].second = v[i][j-1].second;
21+
}
22+
23+
int ans = 0;
24+
for (int i=0; i<m-1; i++) for (int j=i+1; j<m; j++) {
25+
if (check(n, v[i], v[j])) ans++;
26+
}
27+
cout << ans;
28+
}
29+
30+
int main(void) {
31+
ios::sync_with_stdio(false);
32+
cin.tie(nullptr);
33+
34+
solve();
35+
return 0;
36+
}

0 commit comments

Comments
 (0)