452B - 4-point polyline - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
pair<int,int>ans[5];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int n,m;
    cin >> n >> m;
    if(n==1 and m==1){
        cout << "0 0\n";
        cout << "1 1\n";
        cout << "1 0\n";
        cout << "0 1\n";
        return 0;
    }
    if(n==0){
        ans[1].first = 0;
        ans[1].second = 1;
        ans[2].first = 0;
        ans[2].second = m;
        ans[3].first = 0;
        ans[3].second = 0;
        ans[4].first = 0;
        ans[4].second = m-1;
        for(int i = 1;i<=4;i++){
            cout << ans[i].first << " " << ans[i].second << "\n";
        }
        return 0;
    }
    else if(m==0){
        swap(n,m);
        ans[1].first = 0;
        ans[1].second = 1;
        ans[2].first = 0;
        ans[2].second = m;
        ans[3].first = 0;
        ans[3].second = 0;
        ans[4].first = 0;
        ans[4].second = m-1;
        for(int i = 1;i<=4;i++){
            cout << ans[i].second << " " << ans[i].first << "\n";
        }
        return 0;
    }
    if(m>=n){
        double ans1 = 0,ans2 = 0,mm = m,nn = n;
        ans1 = 2*sqrt(nn*nn+mm*mm)+mm;
        ans2 = sqrt(nn*nn+mm*mm)+2*sqrt((nn-1)*(nn-1)+mm*mm);
        if(ans1>=ans2){
            ans[1].first = 0;
            ans[1].second = 0;
            ans[2].first = n;
            ans[2].second = m;
            ans[3].first = n;
            ans[3].second = 0;
            ans[4].first = 0;
            ans[4].second = m;
        }
        else{
            ans[1].first = 1;
            ans[1].second = 0;
            ans[2].first = n;
            ans[2].second = m;
            ans[3].first = 0;
            ans[3].second = 0;
            ans[4].first = n-1;
            ans[4].second = m;
        }
        for(int i = 1;i<=4;i++){
            cout << ans[i].first << " " << ans[i].second << "\n";
        }
    }
    else{
        swap(n,m);
        double ans1 = 0,ans2 = 0,mm = m,nn = n;
        ans1 = 2*sqrt(nn*nn+mm*mm)+mm;
        ans2 = sqrt(nn*nn+mm*mm)+2*sqrt((nn-1)*(nn-1)+mm*mm);
        if(ans1>=ans2){
            ans[1].first = 0;
            ans[1].second = 0;
            ans[2].first = n;
            ans[2].second = m;
            ans[3].first = n;
            ans[3].second = 0;
            ans[4].first = 0;
            ans[4].second = m;
        }
        else{
            ans[1].first = 1;
            ans[1].second = 0;
            ans[2].first = n;
            ans[2].second = m;
            ans[3].first = 0;
            ans[3].second = 0;
            ans[4].first = n-1;
            ans[4].second = m;
        }
        for(int i = 1;i<=4;i++){
            cout << ans[i].second << " " << ans[i].first << "\n";
        }
    }
//    for(int i = 1;i<=4;i++){
//        cout << ans[i].first << " " << ans[i].second << "\n";
//    }
    return 0;
}