poj 3735 Training little cats(矩阵连乘应用)
来源:互联网 发布:linux配置网关命令 编辑:程序博客网 时间:2024/05/16 00:43
Description
Facer's pet cat just gave birth to a brood of little cats. Having considered the health of those lovely cats, Facer decides to make the cats to do some exercises. Facer has well designed a set of moves for his cats. He is now asking you to supervise the cats to do his exercises. Facer's great exercise for cats contains three different moves:
g i : Let the ith cat take a peanut.
e i : Let the ith cat eat all peanuts it have.
s i j : Let the ith cat and jth cat exchange their peanuts.
All the cats perform a sequence of these moves and must repeat it m times! Poor cats! Only Facer can come up with such embarrassing idea.
You have to determine the final number of peanuts each cat have, and directly give them the exact quantity in order to save them.
Input
The input file consists of multiple test cases, ending with three zeroes "0 0 0". For each test case, three integers n, m and k are given firstly, where n is the number of cats and k is the length of the move sequence. The following k lines describe the sequence.
(m≤1,000,000,000, n≤100, k≤100)
Output
For each test case, output n numbers in a single line, representing the numbers of peanuts the cats have.
Sample Input
3 1 6g 1g 2g 2s 1 2g 3e 20 0 0
Sample Output
2 0 1
Source
题意:有n只猫,和k个操作,每次可以给一只猫一个花生,或者让一只猫吃掉手上的所有花生,或者交换两只猫的花生,重复着k个操作m次
分析:本来是很简单的模拟题,不过m太大了,很容易联想到矩阵连乘。。。
然后就是如何转换的问题了,拿一颗花生,其实就是平移。。。。吃掉花生就把对应的行赋值0,交换的话,也就是交换两行
PS:我是不会矩阵的,看了别人的题解才知道平移,记下来了,看来高中落下的一大个坑啊
代码:
#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int mm=111;__int64 a[mm][mm],b[mm][mm],c[mm][mm];int i,j,e,n,m,k;char op[9];void Multi(__int64 a[mm][mm],__int64 b[mm][mm]){ memset(c,0,sizeof(c)); int i,j,k; for(i=1;i<=n+1;++i) for(k=1;k<=n+1;++k) if(a[i][k])for(j=1;j<=n+1;++j) if(b[k][j])c[i][j]+=a[i][k]*b[k][j]; for(i=1;i<=n+1;++i) for(j=1;j<=n+1;++j) a[i][j]=c[i][j];}int main(){ while(scanf("%d%d%d",&n,&m,&k),n+m+k) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(i=1;i<=n+1;++i)a[i][i]=b[i][i]=1; while(k--) { scanf("%s%d",op,&i); if(op[0]=='g')++a[i][n+1]; if(op[0]=='e') for(j=0;j<=n+1;++j)a[i][j]=0; if(op[0]=='s') { scanf("%d",&j); for(e=1;e<=n+1;++e) swap(a[i][e],a[j][e]); } } while(m) { if(m&1)Multi(b,a); Multi(a,a); m>>=1; } for(i=1;i<=n;++i) printf("%I64d%c",b[i][n+1],i<n?' ':'\n'); } return 0;}
- poj 3735 Training little cats(矩阵连乘应用)
- poj 3735 Training little cats 构造矩阵+稀疏矩阵加速连乘+矩阵快速幂
- POJ 3735 Training little cats 矩阵快速幂应用
- poj 3735 Training little cats 矩阵
- poj 3735 Training little cats 矩阵
- poj 3735 Training little cats(构造矩阵)
- poj 3735 Training little cats(矩阵快速幂)
- poj 3735 Training little cats(构造矩阵)
- poj 3735 Training little cats(矩阵构造,快速幂)
- POJ 3735 Training little cats(矩阵快速幂)
- POJ 3735 Training little cats(矩阵快速幂)
- POJ 3735 Training little cats(矩阵快速幂)
- POJ - 3735 Training little cats (矩阵快速幂)
- poj 3735Training little cats (矩阵快速幂)
- pku 3735 Training little cats (矩阵幂乘)
- POJ 3735 Training little cats 矩阵二分幂 + 矩阵优化
- POJ 3735 E - Training little cats POJ - 3735 矩阵构造
- POJ 3735 Training little cats
- 【专题】三分法和牛顿迭代法总结
- matlab读视频、播放视频、写视频
- vb报表(三)——显示时间
- 二叉树的遍历
- java中的枚举
- poj 3735 Training little cats(矩阵连乘应用)
- 体积着色器(Volume Shader)
- word中图片的处理
- 欢迎大家访问吐槽人网 http://www.tucaoman.com/
- poj2771二分图点权最大独立集,用Dinic解决
- Android手机使用笔记本流量上网(基于Android便携式WLAN热点)
- Offer之路
- centos+nginx+php+apc+percona
- 指针也可这么玩:返回局部指针变量,局部噢