제출 #536036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536036		taeyun149	Chess Rush (CEOI20_chessrush)	C++17	8 / 100	1 ms	340 KiB

chessrush

#include <bits/stdc++.h>
using namespace std;
int R,C,M;

void pawn(int a,int b){
    if(a!=b) cout<<"0 0\n";
    else cout<<R-1<<" 1\n";
}

void rook(int a,int b){
    if(a==b) cout<<"1 1\n";
    else cout<<"2 2\n";
}

void queen(int a,int b){
    if(a==b || (a==1&&b==C&&R==C) || (a==C&&b==1&&R==C)) cout<<"1 1\n";
    else {
        int ans=4;
        if(b<a) swap(a,b);
        if((a==1 || b==C)&& R==C) ans++;
        int k=R-(b-a)-1;
        if(k%2==0){
            if(a-k/2>=1) ans++;
            if(b+k/2<=C) ans++;
        }
        cout<<"2 "<<ans<<"\n";
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    char a;
    int b,c;

    cin>>R>>C>>M;
    for(int ii=1;ii<=M;ii++){
        cin>>a>>b>>c;
        if(a=='P') pawn(b,c);
        else if(a=='R') rook(b,c);
        else if(a=='Q') queen(b,c);
        else if(a=='B') cout<<"0 0\n";
        else if(a=='K') cout<<"0 0\n";
    }
    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 8 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 22
• Subtask 5: 0 / 5
• Subtask 6: 0 / 8
• Subtask 7: 0 / 15
• Subtask 8: 0 / 20
• Subtask 9: 0 / 7