UVA11551-Experienced Endeavour
来源:互联网 发布:游戏辅助软件制作 编辑:程序博客网 时间:2024/06/07 15:09
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>using namespace std;#define ll long longll a[55];struct Matrix{ ll v[55][55]; Matrix() { memset(v,0,sizeof v); }}k,l;Matrix mul(Matrix a,Matrix b,int d){ Matrix sum; for(int i=0; i<d; i++) { for(int j=0; j<d; j++) { for(int k=0; k<d; k++) { sum.v[i][j]+=a.v[i][k]*b.v[k][j]; sum.v[i][j]%=1000; } } } return sum;}Matrix mypow(Matrix a,int n,int d){ Matrix sum=k; while(n) { if(n&1) sum=mul(sum,a,d); n>>=1; a=mul(a,a,d); } return sum;}int main(){ int n,r,t; scanf("%d",&t); while(t--) { scanf("%d %d",&n,&r); for(int i=0; i<n; i++) { scanf("%lld",&a[i]); a[i]%=1000; } Matrix m; for(int i=0; i<n; i++) { int x,y; scanf("%d",&x); for(int j=0;j<x;j++) { scanf("%d",&y); m.v[y][i]=1; } } for(int i=0; i<n; i++) k.v[i][i]=1; l=mypow(m,r,n); for(int i=0; i<n; i++) { int ans=0; for(int j=0;j<n;j++) { ans+=a[j]*l.v[j][i]; ans%=1000; } printf("%d",ans); if(i!=n-1) printf(" "); else printf("\n"); } } return 0;}
0 0
- UVA11551-Experienced Endeavour
- UVA 11551 - Experienced Endeavour
- Experienced Endeavour UVA
- 【矩阵快速幂】Experienced Endeavour
- UVA 11551 - Experienced Endeavour(矩阵快速幂)
- uva 11551 - Experienced Endeavour(矩阵快速幂)
- UVA 11551 - Experienced Endeavour(构造矩阵-水题)
- UVA 11551 Experienced Endeavour(矩阵快速幂)
- uva11551experienced endeavour
- POJ 2751 Saving Endeavour
- Experienced In Lucene
- Some experienced note of bugs
- Best Free Spam Filter for Experienced Users
- Crystal.Impact.Endeavour.v1.7f.Cracked-EAT
- 【贪心算法,双机调度问题】:poj2751,Saving Endeavour
- poj2751||51nod1205-贪心&经典问题&双机调度-Saving Endeavour
- Have u ever experienced the grace of C++?
- Technical support officer (Singapore Position/ experienced in Laboratory Environment prefer)
- hbase建表时region预分区的方法
- java设计模式进阶_model-view-presenter
- for循环的执行顺序
- 无人机Mavlink+offboard模式指令概述
- 「cannot open shared object file」的解決方案
- UVA11551-Experienced Endeavour
- why 'not in' can not be followed with 'null'
- 自定义导航
- struts2中Action
- csu1811 Tree Intersection(线段树合并)★ ★ ★
- Nginx常用命令
- 一些名企秋招网申链接合集
- 实验楼Linux学习笔记(三)之 目录结构及文件基本操作
- 第八章 基于Kinectv2跌倒检测系统的总结