cp/usaco/bronze/complete-search/gymnastics.cc
2025-04-30 16:28:40 -04:00

102 lines
2 KiB
C++

#include <bits/stdc++.h> // {{{
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using f128 = long double;
#if __cplusplus >= 202002L
template <typename T> constexpr T MIN = std::numeric_limits<T>::min();
template <typename T> constexpr T MAX = std::numeric_limits<T>::max();
template <typename T> [[nodiscard]] static T sc(auto &&x) {
return static_cast<T>(x);
}
template <typename T> [[nodiscard]] static T sz(auto &&x) {
return static_cast<T>(x.size());
}
#endif
static void NO() { std::cout << "NO\n"; }
static void YES() { std::cout << "YES\n"; }
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ff first
#define ss second
#ifdef LOCAL
#define db(...) std::print(__VA_ARGS__)
#define dbln(...) std::println(__VA_ARGS__)
#else
#define db(...)
#define dbln(...)
#endif
// }}}
void solve() {
u32 k, n;
cin >> k >> n;
vector<vector<u32>> rounds(k, vector<u32>(n));
for (auto &e : rounds)
for (auto &g : e)
cin >> g;
u32 ans = 0;
auto consistent = [&](u32 c1, u32 c2) {
for (u32 i = 0; i < k; ++i) {
bool found_c2 = false;
for (u32 j = 0; j < n; ++j) {
if (rounds[i][j] == c1 && found_c2) {
return false;
}
found_c2 |= rounds[i][j] == c2;
}
}
return true;
};
for (u32 i = 1; i <= n; ++i) {
for (u32 j = 1; j < i; ++j) {
if (consistent(i, j) || consistent(j, i))
++ans;
}
}
cout << ans << '\n';
}
int main() { // {{{
cin.tie(nullptr)->sync_with_stdio(false);
cin.exceptions(cin.failbit);
#define PROBLEM_NAME "gymnastics"
#ifdef LOCAL
freopen("io/" PROBLEM_NAME ".in", "r", stdin);
freopen("io/" PROBLEM_NAME ".out", "w", stdout);
#else
freopen(PROBLEM_NAME ".in", "r", stdin);
freopen(PROBLEM_NAME ".out", "w", stdout);
#endif
solve();
return 0;
}
// }}}