結果
問題 | No.2263 Perms |
ユーザー |
|
提出日時 | 2023-04-07 22:27:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,402 bytes |
コンパイル時間 | 4,462 ms |
コンパイル使用メモリ | 263,416 KB |
最終ジャッジ日時 | 2025-02-12 01:50:27 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 8 TLE * 31 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}//*using mint=modint998244353;const ll mod=998244353;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}//*/int main(){ll N,M;cin>>N>>M;vvi A(N,vi(N));cin>>A;REP(i,N){ll s=0;REP(j,N)s+=A[i][j];if(s!=M){cout<<-1<<endl;return 0;}}REP(i,N){ll s=0;REP(j,N)s+=A[j][i];if(s!=M){cout<<-1<<endl;return 0;}}REP(_,M){vi ans(N);vector<set<ll>>S(N),T(N);REP(j,N)REP(k,N)if(A[j][k]){S[j].insert(k);T[k].insert(j);}ll c=0;while(c<N){ll d=c;REP(j,N)if(sz(S[j])==1){ll t=*S[j].begin();ans[j]=t+1;for(auto x:S[j])if(x!=t)T[x].erase(j);for(auto x:T[t])if(x!=j)S[x].erase(t);S[j].clear();T[t].clear();c++;}REP(j,N)if(sz(T[j])==1){ll t=*T[j].begin();ans[t]=j+1;for(auto x:S[t])if(x!=j)T[x].erase(t);for(auto x:T[j])if(x!=t)S[x].erase(j);S[t].clear();T[j].clear();c++;}if(c==d){REP(j,N)if(sz(S[j])&&ans[j]==0){ll t=*S[j].begin();ans[j]=t+1;for(auto x:S[j])if(x!=t)T[x].erase(j);for(auto x:T[t])if(x!=j)S[x].erase(t);S[j].clear();T[t].clear();c++;}}}REP(j,N)A[j][ans[j]-1]--;cout<<ans<<endl;}return 0;}