結果
| 問題 | No.2263 Perms |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2023-04-07 22:21:02 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 19 ms / 2,000 ms |
| コード長 | 6,187 bytes |
| コンパイル時間 | 2,558 ms |
| コンパイル使用メモリ | 208,952 KB |
| 最終ジャッジ日時 | 2025-02-12 01:44:34 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 39 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
int popcount(int x) { return __builtin_popcount(x); }
int popcount(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
int n = a.size();
vector<T> b(n);
for (int i = 0; i < n; i++) b[i] = a[ord[i]];
swap(a, b);
}
template <typename T>
T floor(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? x / y : (x - y + 1) / y);
}
template <typename T>
T ceil(T x, T y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return (x >= 0 ? (x + y - 1) / y : x / y);
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;
struct Hopcroft_Karp {
vector<vector<int>> es;
vector<int> d, match;
vector<bool> used, used2;
const int n, m;
Hopcroft_Karp(int n, int m) : es(n), d(n), match(m), used(n), used2(n), n(n), m(m) {}
void add_edge(int u, int v) { es[u].push_back(v); }
void _bfs() {
fill(begin(d), end(d), -1);
queue<int> que;
for (int i = 0; i < n; i++) {
if (!used[i]) {
que.push(i);
d[i] = 0;
}
}
while (!que.empty()) {
int i = que.front();
que.pop();
for (auto &e : es[i]) {
int j = match[e];
if (j != -1 && d[j] == -1) {
que.push(j);
d[j] = d[i] + 1;
}
}
}
}
bool _dfs(int now) {
used2[now] = true;
for (auto &e : es[now]) {
int u = match[e];
if (u == -1 || (!used2[u] && d[u] == d[now] + 1 && _dfs(u))) {
match[e] = now, used[now] = true;
return true;
}
}
return false;
}
int max_matching() { // 右側の i は左側の match[i] とマッチングする
fill(begin(match), end(match), -1), fill(begin(used), end(used), false);
int ret = 0;
while (true) {
_bfs();
fill(begin(used2), end(used2), false);
int flow = 0;
for (int i = 0; i < n; i++) {
if (!used[i] && _dfs(i)) flow++;
}
if (flow == 0) break;
ret += flow;
}
return ret;
}
};
void solve() {
int N, M;
cin >> N >> M;
vector<vector<int>> a(N, vector<int>(N));
rep(i, N) rep(j, N) cin >> a[i][j];
vector<vector<int>> ans(M, vector<int>(N, -1));
rep(t, M) {
Hopcroft_Karp G(N, N);
rep(i, N) rep(j, N) {
if (a[i][j] > 0) G.add_edge(i, j);
}
if (G.max_matching() != N) {
cout << "-1\n";
return;
}
rep(i, N) {
a[G.match[i]][i]--;
ans[t][G.match[i]] = i;
}
// rep(i, N) print(a[i]);
}
rep(i, N) rep(j, N) {
if (a[i][j] > 0) {
cout << "-1\n";
return;
}
}
rep(t, M) print(ans[t], 1);
}
int main() {
int T = 1;
// cin >> T;
while (T--) solve();
}