[cf] B. Divine Array 特殊模拟

前言

完蛋,B都这么难,我感觉我要废了,加油啊
传送门 :

思路

因为每次都要变

总共不会超过 $n$次

因此我们可以直接模拟

CODE

// Problem: B. Divine Array
// Contest: Codeforces - Codeforces Round #751 (Div. 2)
// URL: https://codeforces.com/contest/1602/problem/B
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define px first
#define py second

typedef pair<int,int> pii;
int dxy[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
const int N  = 2e3+10;

int a[N];
int b[N][N],cnt[N];
int n,m,t;

void solve()
{
    cin>>n;
    for(int i = 1; i <= n; ++i) 
  	cin>>a[i],b[0][i] = a[i];
    for(int j = 1; j <= n; ++j)
    {
        memset(cnt,0,sizeof(cnt));
        for(int i = 1; i <= n; ++i) cnt[b[j - 1][i]]++;
        for(int i = 1; i <= n; ++i) b[j][i] = cnt[b[j - 1][i]];
    }
    int q;
    cin>>q;
    
    while(q--)
    {
        int x,k;
       cin>>x>>k;
        k = min(k,n);
        cout<<b[k][x]<<endl;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin>>t;
    while(t -- )
        solve();
    return 0;
}