1085C - Connect Three - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

struct point{

    int x,y;

};



queue<point>q;

int main() 

{

#ifdef LOCAL

    freopen("in.txt", "r", stdin);

#endif

    point A,B,C;

    scanf("%d%d%d%d%d%d",&A.x,&A.y,&B.x,&B.y,&C.x,&C.y);

    if(A.x>B.x)swap(A,B);

    if(A.x>C.x)swap(A,C);

    if(B.x>C.x)swap(B,C);

    for(int i=min(A.y,min(B.y,C.y));i<=max(A.y,max(B.y,C.y));i++){

        q.push({B.x,i});

    }

    for(;A.x<B.x;A.x++){

        q.push({A.x,A.y});

    }

    for(;C.x>B.x;C.x--){

        q.push({C.x,C.y});

    }

    printf("%d\n",(int)q.size());

    while(!q.empty()){

        printf("%d %d\n",q.front().x,q.front().y);

        q.pop();

    }

    return 0;

}