結果

問題 No.2263 Perms
ユーザー k1suxu
提出日時 2023-04-08 20:41:53
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 9 ms / 2,000 ms
コード長 3,926 bytes
コンパイル時間 5,830 ms
コンパイル使用メモリ 321,912 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-03 17:52:59
合計ジャッジ時間 7,687 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include"atcoder/all"
using namespace atcoder;
using namespace std;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define pb push_back
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define endl "\n"
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vll vector<ll>
#define vvll vector< vll >
#define vvvll vector< vvll >
#define vvvvll vector< vvvll >
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template <class T>
using V = vector<T>;
constexpr ll INF = (1ll << 60);
// constexpr ll mod = 1000000007;
constexpr ll mod = 998244353;
constexpr double pi = 3.14159265358979323846;
random_device seed_gen;
mt19937 engine(seed_gen());
template <typename T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void pt(T val)
{
    cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v)
{
    ll vs = v.size();
    rep(i, vs)
    {
        cout << v[i];
        if (i == vs - 1)
            cout << "\n";
        else
            cout << " ";
    }
}
ll mypow(ll a, ll n)
{
    ll ret = 1;
    if (n == 0)
        return 1;
    if (a == 0)
        return 0;
    rep(i, n)
    {
        if (ret > (ll)(9e18 + 10) / a)
            return -1;
        ret *= a;
    }
    return ret;
}
long long modpow(long long a, long long n, long long mod)
{
    long long res = 1;
    while (n > 0)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
long long modinv(long long a, long long m)
{
    long long b = m, u = 1, v = 0;
    while (b)
    {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}
//ここまでテンプレ
bool judge(vvll &a, ll m){
    ll n = a[0].size();
    vll c1(n);
    vll c2(n);
    rep(i,n){
        rep(j,n){
            c1[i] += a[i][j];
            c2[j] += a[i][j];
        }
    }
    rep(i,n){
        if(c1[i] != m || c2[i] != m) return false;
    }
    return true;
}
void solve(){
    ll n, m, k, cnt = 0, sum = 0, ans = 0;
    cin>>n>>m;
    assert(2 <= n && n <= 50);
    assert(2 <= m && m <= 50);
    vvll a(n,vll(n));
    rep(i,n){
        rep(j,n){
            cin>>a[i][j];
            assert(0 <= a[i][j] && a[i][j] <= m);
        }
    }
    if(!judge(a,m)){
        pt(-1);
        return;
    }
    vvll p(m,vll(n));
    rep(turn,m){
        mf_graph<ll> graph(2*n + 2);
        rep(i,n){
            rep(j,n){
                ll x = 1;
                if(a[i][j]==0) x = 0;
                graph.add_edge(i, n + j, x);
            }
        }
        rep(i,n){
            graph.add_edge(2 * n, i, 1);
            graph.add_edge(n + i, 2 * n + 1, 1);
        }
        graph.flow(2 * n, 2 * n + 1);
        rep(i,n*n){
            mf_graph<ll>::edge ed = graph.get_edge(i);
            ll x = ed.from;
            ll y = ed.to - n;
            if(ed.flow == 1){
                p[turn][x] = y + 1;
                a[x][y] --;
            }
        }
    }
    rep(i,m){
        pt_vll(p[i]);
    }
}  
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout << fixed << setprecision(16);
    // ll T;
    // cin>>T;
    // rep(ca,T)
    solve();
}   
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0