結果

問題 No.2263 Perms
ユーザー noya2noya2
提出日時 2023-04-07 22:55:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,033 bytes
コンパイル時間 4,836 ms
コンパイル使用メモリ 274,080 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-02 20:13:29
合計ジャッジ時間 8,040 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 RE -
testcase_07 RE -
testcase_08 AC 3 ms
5,248 KB
testcase_09 RE -
testcase_10 AC 2 ms
5,248 KB
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 AC 2 ms
5,248 KB
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 AC 2 ms
5,248 KB
testcase_32 RE -
testcase_33 RE -
testcase_34 AC 2 ms
5,248 KB
testcase_35 AC 2 ms
5,248 KB
testcase_36 RE -
testcase_37 AC 1 ms
5,248 KB
testcase_38 RE -
testcase_39 AC 1 ms
5,248 KB
testcase_40 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

//using mint = modint998244353;
using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}
istream &operator>>(istream &is,vector<mint> &v){for(auto &e:v){ll _x;is>>_x;e=_x;}return is;}


void solve(){
    int n, m; cin >> n >> m;
    vector<vector<int>> a(n,vector<int>(n)); cin >> a;
    vector<int> sx(n,0), sy(n,0);
    rep(i,n) rep(j,n){
        sx[i] += a[i][j];
        sy[j] += a[i][j];
    }
    bool ng = false;
    rep(i,n){
        if (sx[i] != m) ng = true;
        if (sy[i] != m) ng = true;
    }
    if (ng){
        out(-1);
        return ;
    }
    vector<vector<int>> ans(m,vector<int>(n));
    rep(t,m){
        vector<int> p(n,-1);
        auto check = [&](int i, int j){
            auto tx = sx, ty = sy;
            rep(y,n) if (p[y] == -1) tx[y] -= a[i][y];
            repp(x,n,i+1) ty[x] -= a[x][j];
            rep(y,n){
                if (y == j || p[y] != -1) continue;
                if (tx[y] == 0) return false;
            }
            repp(x,n,i+1) if (ty[x] == 0) return false;
            return true;
        };
        rep(i,n){
            rep(j,n){
                if (a[i][j] == 0 || p[j] != -1) continue;
                if (check(i,j)){
                    p[j] = i;
                    rep(y,n) if (p[y] == -1) sx[y] -= a[i][y];
                    repp(x,n,i+1) sy[x] -= a[x][j];
                    sx[j] = 0;
                    sy[i] = 0;
                    a[i][j]--;
                    break;
                }
            }
        }
        rep(x,n){
            if (p[x] == -1){
                //rep(i,t) out(ans[i]);
                //out(p);
                exit(1);
            }
        }
        rep(i,n){
            ans[t][p[i]] = i+1;
            rep(j,n){
                sx[i] += a[i][j];
                sy[j] += a[i][j];
            }
        }
    }
    out(ans);
}


int solve1(int n, int m, vector<vector<int>> a){ auto testa = a;
    vector<int> sx(n,0), sy(n,0);
    rep(i,n) rep(j,n){
        sx[i] += a[i][j];
        sy[j] += a[i][j];
    }
    bool ng = false;
    rep(i,n){
        if (sx[i] != m) ng = true;
        if (sy[i] != m) ng = true;
    }
    if (ng){
        return -1;
    }
    vector<vector<int>> ans(m,vector<int>(n));
    rep(t,m){
        vector<int> p(n,-1);
        auto check = [&](int i, int j){
            auto s = sx;
            rep(y,n) if (p[y] == -1) s[y] -= a[i][y];
            s[j] = 0;
            rep(y,n){
                if (y == j || p[y] != -1) continue;
                if (s[y] == 0) return false;
            }
            return true;
        };
        rep(i,n){
            rep(j,n){
                if (a[i][j] == 0 || p[j] != -1) continue;
                if (check(i,j)){
                    p[j] = i;
                    rep(y,n) if (p[y] == -1) sx[y] -= a[i][y];
                    sx[j] = 0;
                    a[i][j]--;
                    break;
                }
            }
        }
        rep(x,n){
            if (p[x] == -1){
                out(n,m); out(testa);
                exit(1);
            }
        }
        rep(i,n){
            ans[t][p[i]] = i+1;
            rep(j,n) sx[i] += a[i][j];
        }
    }
    //out(ans);
    return 0;
}

/*
#include"random_kyopro.hpp"

void Atest(){
    int n = rnd(4,6);
    int t = rnd(3,10);
    vector<vector<int>> a(n,vector<int>(n,0));
    rep(i,t){
        vector<int> p(n); iota(all(p),0); shuffle(all(p),mt);
        rep(j,n) a[j][p[j]]++;
    }
    int ans = solve1(n,t,a);
}

void test(){
    int t; cin >> t;
    while (t--) test();
}
*/

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
    //while(t--) test();
}
0