vijos1049 送给圣诞夜的礼品

来源：互联网发布：php 获取当前页面参数编辑：程序博客网时间：2024/06/11 10:03

题目大意：顺次给出m个置换，反复使用这m个置换对初始序列进行操作，问k次置换后的序列。m<=10, k<2^31。

题目分析：先将m个置换所使用的矩阵合并起来，然后做T=k/m次。剩下的k%m次模拟即可。

#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<algorithm>#include<functional>#include<cmath>#include<cctype>#include<cassert>#include<climits>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define ForD(i,n) for(int i=n;i;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define RepD(i,n) for(int i=n;i>=0;i--)#define MEM(a) memset(a,0,sizeof(a))#define MEMI(a) memset(a,127,sizeof(a))#define MEMi(a) memset(a,128,sizeof(a))#define INF (2139062143)#define phiF (1000000006)#define MAXN (1000000+10)typedef long long LL;int n,m,k,a[20][105],ans[105],C[105],use[105];inline void calc(int *A,int *B){For (i,n) C[i]=A[B[i]];For (i,n) A[i]=C[i];}int main(){//freopen("in.txt","r",stdin);    scanf("%d%d%d",&n,&m,&k);    For (i,m)      For (j,n)      scanf("%d",&a[i][j]);    For (i,n) use[i]=ans[i]=i;    For (i,m) calc(use,a[i]);    int l=k/m;k%=m;    while (l){    if (l%2) calc(ans,use);    l/=2;    calc(use,use);    }    For (i,k) calc(ans,a[i]);    For (i,n) printf("%d ",ans[i]);}

0 0