Submission #1339793

#	Time	Username	Problem	Language	Result	Execution time	Memory
1339793		tudor_costin	Superpiece (EGOI22_superpiece)	C++20	0 / 100	3 ms	344 KiB

Main

#include <bits/stdc++.h>

using namespace std;
void solve()
{
    string s;
    cin>>s;
    assert(s=="N");
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    int p=abs(a-c),q=abs(b-d);
    int l=0,r=1e9;
    int ans=r;
    while(l<=r)
    {
        int mid=(l+r)/2;
        int B=mid;
        pair<int,int> intervy={0,min(B,2*B-p)};
        pair<int,int> intervx={0,min(B,2*B-q)};
        if(intervy.first%2!=p%2) intervy.first++;
        if(intervy.second%2!=p%2) intervy.second--;
        if(intervx.first%2!=q%2) intervx.first++;
        if(intervx.second%2!=q%2) intervx.second--;
        bool ok=1;
        if(intervy.first>intervy.second) ok=0;
        if(intervx.first>intervx.second) ok=0;
        ///cout<<mid<<' '<<intervx.first<<' '<<intervx.second<<'\n';
        int low=intervy.first+intervx.first,high=intervx.second+intervy.second;
        if(B<low || B>high) ok=0;
        if(ok)
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    cout<<ans<<'\n';
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 8
• Subtask 5: 0 / 6
• Subtask 6: 0 / 31
• Subtask 7: 0 / 8
• Subtask 8: 0 / 7
• Subtask 9: 0 / 6