Форум Всеукраїнської інтернет-олімпіади NetOI

#include<algorithm>
#include<cstdio>

using namespace std;

#define N        1000
#define HASH    2097151

struct Pencil{
    int x0,y0,x1,y1;
    inline void read(){
        scanf("%d%d%d%d",&x0,&y0,&x1,&y1);
        if(x0>x1||x0==x1&&y0>y1)
            swap(x0,x1),swap(y0,y1);
    }    
}a[N],b[N],*ae,*be;

int n;

struct FF{
    FF*next;
    int q;
    short c;
}*h[HASH+1],q[N*N],*f=q;

int main(){
    freopen("x.in","r",stdin);
    freopen("x.out","w",stdout);
       scanf("%d",&n),ae=a+n,be=b+n;
       Pencil*i,*j;
       for(i=a;i<ae;(i++)->read());
       for(j=b;j<be;(j++)->read());
       int dx,dy,hsh,p,res=0;
       FF* k;
       for(i=a;i<ae;++i)for(j=b;j<be;++j)
           if((dx=(i->x0-j->x0))==(i->x1-j->x1) && (dy=(i->y0-j->y0))==(i->y1-j->y1)){
               p=dy^(dx<<15);
               hsh=(dx^(dy*519))&HASH;
               for(k=h[hsh];k && p!=k->q;k=k->next);
               if(k==NULL)
                   f->next=h[hsh],h[hsh]=f,
                   f->q=p,(f++)->c=1,res>?=1;
               else if(++(k->c)>res)res=k->c;
           }    
       printf("%d\n",n-res);
    return 0;
}

#include<iostream>
#include<cstdio>
#include<ctime>

using namespace std;

#define N    1000
#define R    0
#define S    10000

#define F_CENSORED_K

inline int rnd(){
    return (rand()%(S+1))-(rand()%(S+1));
}    

int dx,dy;

struct Pencil{
    int x0,y0,x1,y1;
    inline void random(){
        x0=rnd(),y0=rnd(),x1=rnd(),y1=rnd();
    }    
    inline void operator=(Pencil&p){
        x0=p.x0+dx,y0=p.y0+dy,
        x1=p.x1+dx,y1=p.y1+dy;
    }    
    inline void print(){
#ifdef F_CENSORED_K
        printf("%d %d %d %d ",x0,y0,x0+1,y0+1);
#else
        printf("%d %d %d %d ",x0,y0,x1,y1);
#endif
    }    
}a[N],b[N];
bool da[N],db[N];

int main(){
    srand(time(0));
    freopen("x.in","w",stdout);
    printf("%d ",N);
    for(int i=0;i<N;++i)
        a[i].random(),b[i].random();
    dx=rnd(),dy=rnd();
    for(int k=N-R;k;--k){
        int i,j;
        do i=rand()%N;
        while(da[i]);da[i]=true;
        do j=rand()%N;
        while(db[j]);db[j]=true;
        a[i]=b[i];
    }    
    for(int i=0;i<N;++i)a[i].print();
    for(int i=0;i<N;++i)b[i].print();
    return 0;
}