CF858D Polycarp's phone book（贪心+字符串）

贪心地瞎排序一波就好了qaq
填补很久以前的坑qaq

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 70010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,a[N],bin[10];
struct Icefox{
    int x,id;
    friend bool operator<(Icefox a,Icefox b){return a.x<b.x;}
}b[N*9],ans[N];
inline void solve(int len){
    int owo=0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=9;++j){
            int r=j+len-1;if(r>9) break;
            b[++owo].id=i,b[owo].x=a[i]/bin[9-r]%bin[len];
        }sort(b+1,b+owo+1);
    int id=b[1].id;
    for(int i=2;i<=owo;++i){
        if(b[i].x!=b[i-1].x){
            if(id&&!ans[id].id) ans[id].x=b[i-1].x,ans[id].id=len;
            id=b[i].id;
        }if(id&&b[i].id!=id) id=0;
    }if(id&&!ans[id].id) ans[id].id=len,ans[id].x=b[owo].x;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) a[i]=read();bin[0]=1;
    for(int i=1;i<=9;++i) bin[i]=bin[i-1]*10;
    for(int i=1;i<=9;++i) solve(i);
    for(int i=1;i<=n;++i){
        int x=1;while(bin[x]<=ans[i].x) ++x;
        while(x<ans[i].id) putchar('0'),++x;
        printf("%d\n",ans[i].x);
    }return 0;
}