1065. Single Dog (_pat) (b)

1065. Single dog
C + + map AC code view 1121. Damn single
or github:1065. Bachelor dog)

#include <stdio.h> #include <stdlib.h> int couple[100000];
    struct REC {int id;
int notinlist;
}STAY[10000+1]; int comp (const void*a,const void*b) {return ((struct rec*) a)->id-((struct rec*) b)->id;} int main () {int n
    , M,i,j;
    for (i=0;i<100000;++i) couple[i]=-1;
    scanf ("%d", &n);
        while (n--) {int a,b;
        scanf ("%d%d", &a,&b);
    Couple[a]=b;couple[b]=a;
    } scanf ("%d", &m);
    for (I=0;i<m;++i) scanf ("%d", &stay[i].id);
    Qsort (stay,m,sizeof (struct rec), comp);
        for (i=0;i<m;++i) {int k=couple[stay[i].id];
            if (k!=-1&&stay[i].notinlist==0) {j=i+1;
            while (stay[j].id<k&&j<m) ++j;
                if (stay[j].id==k) {stay[j].notinlist=1;
            Stay[i].notinlist=1;
    {}} int ans[10000+1],c=0; for (I=0;i<m;++i) if (stay[i].notinlist==0) Ans[c++]=stay[i].id;
    printf ("%d\n", c);
        for (i=0;i<c;++i) {printf ("%05d", Ans[i]);
    if (i!=c-1) printf ("");
return 0; }