UVA: 11551 - Experienced Endeavour (Matrix expoentiation)

UVA: 11551 - Experienced Endeavour (Matrix expoentiation)

///==================================================///
/// !! HELLO WORLD !! ///
/// IT'S ME - BISHAL GAUTAM ///
/// [ bsal.gautam16@gmail.com ] ///
///==================================================///
#include<bits/stdc++.h>
#define X first
#define Y second
#define mpp make_pair
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb(x) push_back(x)
#define nl printf("\n")
#define Max(a,b) ((a>b)?a:b)
#define Min(a,b) ((a<b)?a:b)
#define SZ(x) (int)(x.size())
///---------------------
#define S(a) scanf("%d",&a)
#define P(a) printf("%d",a)
#define SL(a) scanf("%lld",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define SL2(a,b) scanf("%lld%lld",&a,&b)
///------------------------------------
#define all(v) v.begin(),v.end()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a) memset(a,-1,sizeof(a))
#define fr(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
typedef long long ll;

/// Digit 0123456789012345678 ///
#define MX 55
#define inf 2000000010
#define eps 1e-9
#define MD 1000
///===============================///

#define N 52
int ms;///Matrix Size GLOBAL: N
struct mat {
ll m[N][N];
mat() {};
void Nullify( ) {
for(int i=0; i<ms; i++) {
for(int j=0; j<ms; j++) {
m[i][j]=0;
}
}
}
void Unify( ) {
for(int i=0; i<ms; i++) {
for(int j=0; j<ms; j++) {
m[i][j]=(i==j);
}
}
}
mat operator *(const mat &b )const {
mat c;
for(int i=0; i<ms; i++) {
for(int j=0; j<ms; j++) {
c.m[i][j]=0;
for(int k=0; k<ms; k++) {
c.m[i][j]=( c.m[i][j]+ (m[i][k]*b.m[k][j])%MD )%MD;
}
}
}
return c;
}
mat Pow(int p) {
mat ret;
ret.Unify();
mat B=(*this);
for(; p; p>>=1) {
if(p & 1)ret = (ret * B);
B = (B * B);
}
return ret;
}
void Print( ) {
cout<<endl;
cout<< "Matix is:\n";
cout<< "****************************\n";
for(int i=0; i<ms; i++) {
for(int j=0; j<ms; j++) {
cout<<m[i][j]<< " ";
}
cout<<endl;
}
cout<< "****************************\n";
cout<<endl;
}
} b;

int ar[MX+2];
int main() {
int tc,cs=1,i,j,k,n,r,x;
S(tc);
while(tc--) {
S2(n,r);
for(i=0; i<n; i++) {
S(ar[i]);
}
ms=n;
b.Nullify();
for(i=0; i<n; i++) {
S(k);
for(j=0; j<k; j++) {
S(x);
b.m[ i ][ x ]=1;
}
}

mat ret=b.Pow(r);

for(i=0; i<n; i++) {
ll ans=0;
for(j=0; j<n; j++) {
ans=(ans+ (ret.m[i][j]*ar[j])%MD )%MD;
}
printf("%lld%c",ans,(i==n-1)?'\n':' ');
}
}
return 0;
}

Comments

Popular posts from this blog

HackerEarth: City and Campers 2 (DSU-UnionFind)

Two Pointers Technique & Binary Search For Beginners

Problem : Codeforces Round #406 (Div. 1) B [ Legacy ]( Dijakstra, Segment tree)