CF1774D Same Count One
CF1774D Same Count One
非常好 *1600 签到题。
求出 \(1\) 的总数目 \(x\),则最终每行均为 \(\frac{x}{n}\),不能整除无解。
考虑按照 \(1\) 的数目对行排序,异向双指针维护匹配过程,将小值和大值逐个匹配即可。
const int N = 1e6 + 5;
int n, m, cnt[N], id[N];
vector<vector<int>> a;
void _main() {
cin >> n >> m; a.clear();
a.resize(n+5, vector<int>(m+5));
fill(cnt + 1, cnt + n + 1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++)
cin >> a[i][j], cnt[i] += (a[i][j] == 1);
}
int sum = accumulate(cnt + 1, cnt + n + 1, 0);
if (sum % n) return cout << -1 << '\n', void();
sum /= n;
iota(id + 1, id + n + 1, 1);
sort(id + 1, id + n + 1, [](int x, int y) {
return cnt[x] < cnt[y];
});
vector<tuple<int, int, int>> vec;
for (int i = 1, j = n; i < j; ) {
for (int x = 1; x <= m; x++) {
if (cnt[id[i]] == sum || cnt[id[j]] == sum) break;
if (a[id[i]][x] == 0 && a[id[j]][x] == 1) {
swap(a[id[i]][x], a[id[j]][x]);
++cnt[id[i]], --cnt[id[j]];
vec.pb(id[i], id[j], x);
}
}
if (cnt[id[i]] == sum) i++;
if (cnt[id[j]] == sum) j--;
}
for (int i = 1; i <= n; i++)
if (cnt[i] != sum) return cout << -1 << '\n', void();
cout << vec.size() << '\n';
for (auto [x, y, z] : vec) cout << x << ' ' << y << ' ' << z << '\n';
}

浙公网安备 33010602011771号