Codeforces Round #528 (Div. 2, based on Technocup 2019 Elimination Round 4)-C-Connect Three

 

 

 

 

题目链接

题意

给你三个点，让你把他们连起来，问最小需要多少多少个格子

解法

从一个点到另一个点有两种方式，要么先走x，再走y，要么先走y，后走x，三个点，那么就是有4中可能

但是这样不一定是最优，所以要枚举一个全排列，然后暴力把点放进数组，然后sort去重，更新ansk即可

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4+7;
struct point{
    int x,y;
    bool operator < (const point &a)const{
        if(x!=a.x)
            return x<a.x;
        return y<a.y;
    }
    bool operator == (const point &a)const{
        return y==a.y&&x==a.x;
    }
}ans[maxn],tans[maxn],A[3];
int add(point p[],int n,point a,point b,int flag){
    if(!(a<b))
        swap(a,b);
    if(flag){
        for(int x=a.x;x<=b.x;x++)
            p[n++] = point{x,a.y};
        int Mxy = max(a.y,b.y);
        for(int y=min(a.y,b.y);y<=Mxy;y++)
            p[n++] = point{b.x,y};
    }else{
        for(int x=a.x;x<=b.x;x++)
            p[n++] = point{x,b.y};
        int Mxy = max(a.y,b.y);
        for(int y=min(a.y,b.y);y<=Mxy;y++)
            p[n++] = point{a.x,y};
    }
    return n;
}
int main(){
    for(int i=0;i<3;i++)
        scanf("%d%d",&A[i].x,&A[i].y);getchar();
    int ansk = 0x3f3f3f3f;
    int id[3] = {0,1,2};
    do{
        for(int lw=0;lw<(1<<2);lw++){
            int cnt = add(tans,0,A[id[0]],A[id[1]],lw&1);
            cnt = add(tans,cnt,A[id[1]],A[id[2]],lw>>1&1);
            sort(tans,tans+cnt);
            cnt = unique(tans,tans+cnt)-tans;
            if(ansk>cnt){
                memcpy(ans,tans,cnt*sizeof(point));
                ansk = cnt;
            }
        }
    }while(next_permutation(id,id+3));

    printf("%d\n",ansk);
    for(int i=0;i<ansk;i++)
        printf("%d %d\n",ans[i].x,ans[i].y);
    return 0;
}

 

惯例，写对后压行，不压不舒服

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4+7;
struct point{
    int x,y;
    bool operator < (const point &a)const{
        return x!=a.x?x<a.x:y<a.y;
    }
    bool operator == (const point &a)const{
        return y==a.y&&x==a.x;
    }
}ans[maxn],tans[maxn],A[3];
int add(point p[],int n,point a,point b,int flag){
    if(!(a<b))
        swap(a,b);
    for(int x=a.x;x<=b.x;x++)
        p[n++] = point{x,flag?a.y:b.y};
    int Mxy = max(a.y,b.y);
    for(int y=min(a.y,b.y);y<=Mxy;y++)
        p[n++] = point{flag?b.x:a.x,y};
    return n;
}
int main(){
    for(int i=0;i<3;i++)
        scanf("%d%d",&A[i].x,&A[i].y);getchar();
    int ansk = 0x3f3f3f3f;
    int id[3] = {0,1,2};
    do{
        for(int lw=0;lw<(1<<2);lw++){
            int cnt = add(tans,0,A[id[0]],A[id[1]],lw&1);
            cnt = add(tans,cnt,A[id[1]],A[id[2]],lw>>1&1);
            sort(tans,tans+cnt);
            cnt = unique(tans,tans+cnt)-tans;
            if(ansk>cnt){
                memcpy(ans,tans,cnt*sizeof(point));
                ansk = cnt;
            }
        }
    }while(next_permutation(id,id+3));

    printf("%d\n",ansk);
    for(int i=0;i<ansk;i++)
        printf("%d %d\n",ans[i].x,ans[i].y);
    return 0;
}