2818:密码

网址如下：

OpenJudge - 2818:密码

一道模拟题

关键在于对循环节的长度的计算

然后缩短加密次数

刚开始是对所有循环节的长度求最小公倍数来算的：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>

const int maxn = 201;

int key[maxn], ans[maxn], tmp[maxn], n, k;
char str[maxn];

void input(void){
    int cur = 1;
    while((str[cur++] = getchar()) != '\n');
    cur--;
    while(cur <= n) str[cur++] = ' ';
}
int get_len(void){
    bool vis[maxn]{}; int l = 1;
    std::set<int> s;
    for(int i = 1; i <= n; i++){
        if(vis[i]) continue;
        int len = 1; vis[i] = true;
        for(int j = key[i]; j != i; j = key[j]){vis[j] = true; len++;}
        s.insert(len);
    }
    for(auto it = s.begin(); it != s.end(); it++) l = l * (*it) / std::__gcd(l, *it);
    return l;
}
void get_print_ans(void){
    for(int i = 1; i <= n; i++) ans[i] = i;
    for(int i = 0; i < k; i++){
        for(int j = 1; j <= n; j++) tmp[key[j]] = ans[j];
        memcpy(ans, tmp, sizeof(int) * (n + 1));
    }
    for(int i = 1; i <= n; i++) putchar(str[ans[i]]);
    putchar('\n');
}

int main(void)
{
    while(scanf("%d", &n) == 1 && n){
        for(int i = 1; i <= n; i++) scanf("%d", &key[i]);
        while(scanf("%d", &k) == 1 && k){
            getchar(); input();
            int len = get_len(); k %= len;
            get_print_ans();
        }
        putchar('\n');
    }

    return 0;
}

但是tle了

后面改成直接对单独循环节长度进行计算，毕竟最小公倍数可能很大

代码如下：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>

const int maxn = 201;

int key[maxn], ans[maxn], tmp[maxn], n, k;
char str[maxn];

void input(void){
    int cur = 1;
    while((str[cur++] = getchar()) != '\n');
    cur--;
    while(cur <= n) str[cur++] = ' ';
}
void get_print_ans(void){
    std::vector<int> vet;
    bool vis[maxn]{};
    for(int i = 1; i <= n; i++){
        if(vis[i]) continue;
        vet.clear(); vet.push_back(i); vis[i] = true;
        int len = 1;
        for(int j = key[i]; j != i; j = key[j], len++){vis[j] = true; vet.push_back(j);}
        int step = k % len;
        for(int j = 0; j < vet.size(); j++)
            ans[vet[(j + step) % len]] = vet[j];
    }
    for(int i = 1; i <= n; i++) putchar(str[ans[i]]);
    putchar('\n');
}

int main(void)
{
    while(scanf("%d", &n) == 1 && n){
        for(int i = 1; i <= n; i++) scanf("%d", &key[i]);
        while(scanf("%d", &k) == 1 && k){
            getchar(); input();
            get_print_ans();
        }
        putchar('\n');
    }

    return 0;
}