Submission #1367290

#	Time	Username	Problem	Language	Result	Execution time	Memory
1367290		biserailieva	Superpiece (EGOI22_superpiece)	C++20	42 / 100	2 ms	348 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int q;
    cin>>q;
    while(q--)
    {
        string s;
        cin>>s;
        long long a, b, c, d;
        cin>>a>>b>>c>>d;
        if(a==c && b==d)
        {
            cout<<0<<endl;
        }
        else if(s.find('Q')!=string::npos)
        {
            if(s.find('N')!=string::npos)
            {
                if((c==a+1 && d==b+2) ||
                   (c==a+1 && d==b-2) ||
                    (c==a+2 && d==b+1) ||
                    (c==a+2 && d==b-1) || 
                    (c==a-2 && d==b+1) ||
                    (c==a-2 && d==b-1) || 
                    (c==a-1 && d==b+2) ||
                    (c==a-1 && d==b-2))
                    {
                        cout<<1<<endl;
                    }
                else
                {
                    if(a==c || b==d || abs(a-c)==abs(b-d))
                    {
                        cout<<1<<endl;
                    }
                    else
                    {
                        cout<<2<<endl;
                    }
                }
            }
            else
            {
                if(a==c || b==d || abs(a-c)==abs(b-d))
                {
                    cout<<1<<endl;
                }
                else
                {
                    cout<<2<<endl;
                }
            }
        }
        else if(s=="P")
        {
            if(b!=d || a>c)
            {
                cout<<-1<<endl;
            }
            else
            {
                cout<<c-a<<endl;
            }
        }
        else if(s=="KP" || s=="K")
        {
            cout<<max(abs(a-c), abs(b-d))<<endl;
        }
        else if(s=="B")
        {
            if(abs((a+b)%2)!=abs((c+d)%2))
            {
                cout<<-1<<endl;
            }
            else if((a-c==b-d) || (a-c==d-b))
            {
                cout<<1<<endl;
            }
            else
            {
                cout<<2<<endl;
            }
        }
        else if(s[0]=='R')
        {
            if(s.find('N')!=string::npos)
            {
                if((c==a+1 && d==b+2) ||
                   (c==a+1 && d==b-2) ||
                    (c==a+2 && d==b+1) ||
                    (c==a+2 && d==b-1) || 
                    (c==a-2 && d==b+1) ||
                    (c==a-2 && d==b-1) || 
                    (c==a-1 && d==b+2) ||
                    (c==a-1 && d==b-2))
                    {
                        cout<<1<<endl;
                    }
            }
            else if(s.find('B')!=string::npos)
            {
                if((a-c==b-d) || (a-c==d-b))
                {
                    cout<<1<<endl;
                }
            }
            else
            {
                if((a==c && b!=d) || (a!=c && b==d))
                {
                    cout<<1<<endl;
                }
                else
                {
                    cout<<2<<endl;
                }
            }
        }
    }
    return 0;
}

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