The Preliminary Contest for ICPC Asia Xuzhou 2019 Center

 https://nanti.jisuanke.com/t/41393

The Preliminary Contest for ICPC Asia Xuzhou 2019 Center_第1张图片

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
//#include 
//#include 
#include 
//#include
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

templateinline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e3+9;
const int maxm=3e6+9;
const int mod=20090126;

struct point
{
    int x,y;
}p[maxn];
map,int >mp;
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].x>>p[i].y;
        p[i].x*=2;
        p[i].y*=2;
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            int x=p[i].x;
            int xx=p[j].x;
            int y=p[i].y;
            int yy=p[j].y;
            mp[{(x+xx)/2,(y+yy)/2}]++;
        }
    }

    int ans=INF;

    for(map,int>::iterator it=mp.begin();it!=mp.end();it++)
    {
        ans=min(ans,n-(it->second));
    }
    cout<

 

你可能感兴趣的:(The Preliminary Contest for ICPC Asia Xuzhou 2019 Center)