結果
問題 | No.2405 Minimal Matrix Decomposition |
ユーザー |
👑 ![]() |
提出日時 | 2023-08-04 22:07:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,292 ms / 2,000 ms |
コード長 | 3,264 bytes |
コンパイル時間 | 2,602 ms |
コンパイル使用メモリ | 217,428 KB |
最終ジャッジ日時 | 2025-02-15 22:47:26 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 46 |
ソースコード
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; const ll ILL=2167167167167167167; const int INF=2100000000; int mod=998244353; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";} template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} ll jyo(ll x,ll y,ll z){ ll H=y; //ここから ll a=1,b=(x%z+z)%z,c=1; while(H>0){ a*=2; if(H%a!=0){ H-=a/2; c*=b; c%=z; } b*=b; b%=z; } //ここまで return c; } void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,0,t) solve(); } void solve(){ cin>>mod; int N,M; cin>>N>>M; vector A(N,vector<ll>(M)); rep(i,0,N) rep(j,0,M) cin>>A[i][j]; if(N==1||M==1){ cout<<"1\n"; cout<<N<<" "<<M<<"\n"; rep(i,0,N) vec_out(A[i]); return; } auto base=A; vector<int> seen(N); map<int,int> m; int C=0; vector<int> q; rep(i,0,M){ int ind=0; while(ind<N){ A[ind][i]%=mod; if(seen[ind]==0&&A[ind][i]!=0){ seen[ind]=1; break; } ind++; } if(ind==N) continue; m[i]=C; C++; q.push_back(ind); ll tmp=jyo(A[ind][i],mod-2,mod); rep(j,0,M) A[ind][j]=(A[ind][j]*tmp)%mod; rep(j,0,N){ if(j==ind) continue; tmp=A[j][i]; rep(k,0,M) A[j][k]=(A[j][k]-A[ind][k]*tmp%mod+mod)%mod; } } //rep(i,0,N) vec_out(A[i]); if(C==0){ cout<<"2\n"; cout<<N<<" 1\n"; rep(i,0,N) cout<<"0\n"; cout<<"1 "<<M<<"\n"; rep(i,0,M){ if(i) cout<<" "; cout<<0; } cout<<"\n"; return; } if(C*(N+M)>N*M){ cout<<"1\n"; cout<<N<<" "<<M<<"\n"; rep(i,0,N) vec_out(base[i]); return; } cout<<"2\n"; vector X(N,vector<ll>(C)); vector Y(C,vector<ll>(M)); rep(i,0,M){ if(m.count(i)){ rep(j,0,N) X[j][m[i]]=base[j][i]; Y[m[i]][i]=1; } else{ rep(j,0,C) Y[j][i]=A[q[j]][i]; } } cout<<N<<" "<<C<<"\n"; rep(i,0,N) vec_out(X[i]); cout<<C<<" "<<M<<"\n"; rep(i,0,C) vec_out(Y[i]); }