A - Infinite Fraction Path(bfs+剪枝

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e5+10;
char ch[N];int t,n;
int cur[N],vis[N],a[N],d[N];
struct node{
    int val,pos,cur;
};
struct compare
{
    bool operator()(const node &a, const node &b) const
    {
        if (a.cur != b.cur) return a.cur > b.cur;
        else if (a.val != b.val) return a.val < b.val;
        return a.pos > b.pos;
    }
};
priority_queue<node, vector<node>, compare> q;
int main(){
    scanf("%d",&t);
    int cas=0;
    while(t--){
        scanf("%d",&n);scanf("%s",ch);
        int mx=0,sz=strlen(ch);
        for(int i=0;i<sz;i++){
            cur[i]=vis[i]=-1;
            a[i]=ch[i]-'0';
            mx=max(mx,a[i]);
            d[i]=(int)(((ll)i*(ll)i+1)%(ll)sz);
        }
        for(int i=0;i<sz;i++) if(a[i]==mx) q.push({a[i],i,0});
        while(q.size()){
            node tp=q.top();
            q.pop();
            if(cur[tp.cur]==-1) cur[tp.cur]=tp.val;
            if(cur[tp.cur]>tp.val) continue;
            if(vis[tp.pos]<tp.cur) vis[tp.pos]=tp.cur;
            else continue;
            if(tp.cur==sz-1) break;
            q.push({a[d[tp.pos]],d[tp.pos],tp.cur+1});
        }
        while(q.size()) q.pop();
        printf("Case #%d: ",++cas);
        for(int i=0;i<sz;i++)
        printf("%d",cur[i]);
        printf("\n");
    }
}