POJ3735矩阵的幂

Training little cats

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11662		Accepted: 2867

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 6
g 1
g 2
g 2
s 1 2
g 3
e 2
0 0 0

Sample Output

2 0 1

题目大意：

        有n只猫，然后会执行k个命令，最后重复m次该命令，求最后每个猫有多少个花生

遇到的问题和解决办法：

       这道题目的关键就是在于如何建立矩阵和输入g和e时候矩阵的变化。具体的可以看这位大牛的http://blog.csdn.net/u013068502/article/details/38355621?utm_source=tuicool&utm_medium=referral

      还有，之前使用vector动态内存分配构造了矩阵，vec的执行速度比起struct较慢，一直TLE。（新手不知道为啥，有大牛知道的话评论里教教我呗TAT）

给出AC代码：

#include<cstdio> #include<cmath> #include<cstring> #include<algorithm> using namespace std; typedef long long ll; struct mat{ ll map[100 + 5][100 + 5]; }; ll n, m, k; mat mul(mat a, mat b){ mat c; memset(c.map, 0, sizeof(c.map)); for (int i = 0; i <= n; i++){ for (int k = 0; k <= n; k++){ if (a.map[i][k]) for (int j = 0; j <= n; j++){ c.map[i][j] = c.map[i][j] + a.map[i][k] * b.map[k][j]; } } } /*for (int i = 0; i <= n; i++){ for(int j = 0; j <= n; j++){ printf("%d%c", b.map[i][j], j == n? '\n':' '); } } printf("\n"); */ return c; } mat pow_mod(mat a, int m){ mat b; memset(b.map, 0, sizeof(b.map)); for (int i = 0; i <= n; i++){ b.map[i][i] = 1; } while (m > 0){ if (m & 1) b = mul(a, b); a = mul(a, a); m >>= 1; } /*for (int i = 0; i <= n; i++){ for(int j = 0; j <= n; j++){ printf("%d%c", b.map[i][j], j == n? '\n':' '); } } printf("\n");*/ return b; } void init(mat &a){ char ch[2]; for (int i = 0; i <= n; i++){ a.map[i][i] = 1; } for (int i = 0; i < k; i++){ scanf("%s", ch); ll x, y; if (ch[0] == 'g'){ scanf("%I64d", &x); a.map[x - 1][n]++; } else if (ch[0] == 's'){ scanf("%I64d%I64d", &x, &y); for (int i = 0; i <= n; i++){ swap(a.map[x - 1][i], a.map[y - 1][i]); } } else { scanf("%I64d", &x); for (int i = 0; i <= n; i++){ a.map[x - 1][i] = 0; } } } } int main(){ while(scanf("%I64d%I64d%I64d", &n, &m, &k) != EOF){ if (n == 0 && m ==0 && k == 0)break; mat a; memset(a.map, 0, sizeof(a.map)); init(a); a = pow_mod(a, m); /*for (int i = 0; i <= n; i++){ for(int j = 0; j <= n; j++){ printf("%d%c", a.map[i][j], j == n? '\n':' '); } }*/ for (int i = 0; i < n; i++){ printf("%I64d%c", a.map[i][n], i == n - 1? '\n':' '); } } return 0; } </algorithm></cstring></cmath></cstdio>

超时的代码

#include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<vector> using namespace std; typedef vector<int> vec; typedef vector<vec> mat; typedef long long ll; int n, m, k; mat mul(mat a, mat b){ mat c(a.size(), vec(a.size())); for (int i = 0; i <= n; i++){ for (int k = 0; k <= n; k++){ if (a[i][k]) for (int j = 0; j <= n; j++){ c[i][j] = c[i][j] + a[i][k] * b[k][j]; } } } return c; } mat pow_mod(mat a, int m){ mat b(a.size(), vec(a.size())); for (int i = 0; i <= n; i++){ b[i][i] = 1; } while (m > 0){ if (m & 1) b = mul(a, b); a = mul(a, a); m >>= 1; } /*for (int i = 0; i <= n; i++){ for(int j = 0; j <= n; j++){ printf("%d%c", b[i][j], j == n? '\n':' '); } }*/ return b; } void init(mat &a){ char ch[2]; for (int i = 0; i <= n; i++){ a[i][i] = 1; } for (int i = 0; i < k; i++){ scanf("%s", ch); int x, y; if (ch[0] == 'g'){ scanf("%d", &x); a[x - 1][n]++; } else if (ch[0] == 's'){ scanf("%d%d", &x, &y); for (int i = 0; i <= n; i++){ swap(a[x - 1][i], a[y - 1][i]); } } else { scanf("%d", &x); for (int i = 0; i <= n; i++){ a[x - 1][i] = 0; } } } } int main(){ while(scanf("%d%d%d", &n, &m, &k) != EOF){ if (n == 0 && m ==0 && k == 0)break; mat a(n + 1, vec(n + 1)); init(a); a = pow_mod(a, m); /*for (int i = 0; i <= n; i++){ for(int j = 0; j <= n; j++){ printf("%d%c", a[i][j], j == n? '\n':' '); } }*/ for (int i = 0; i < n; i++){ printf("%d%c", a[i][n], i == n - 1? '\n':' '); } } return 0; } </vec></int></vector></cmath></cstring></algorithm></cstdio>