【并查集】String Reconstruction

CF827A String Reconstruction

今日胡策题

一个披着字符串外衣的并查集qwq

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int sz = 1000000;
int n, m, maxx = 0, len = 0, pos = 0;
int f[sz+10];
string ans="";
void init() {
    for(int i = 0; i < sz; i++) {
        f[i] = i;
        ans += "a";
    }
}
int find(int x) {
    if(x != f[x]) f[x] = find(f[x]);
    return f[x];
}
void print() {
    for(int i = 0; i < maxx; i++) 
        cout<<ans[i];
}
int main() {
//    freopen("tsf.in", "r", stdin);
//    freopen("tsf.ans", "w", stdout);
    scanf("%d", &n);
    init();
    for(int i = 1; i <= n; i++) {
        string s;
        cin>>s;
        scanf("%d", &m);
        int len = s.size();
        for(int j = 1; j <= m; j++) {
            scanf("%d", &pos);
            pos -= 1;
            int mid = pos + len;
            if(mid > maxx) maxx = mid;
            for(int k = pos; k < mid; ) {
                int r1 = find(k);
                if(r1 > mid - 1) break;
                ans[r1] = s[r1 - pos];
                f[r1] = r1 + 1;
                k = f[r1];
            }
        }
    }
    print();
    return 0;
}