제출 #536030

#제출 시각아이디문제언어결과실행 시간메모리
536030taeyun149Chess Rush (CEOI20_chessrush)C++17
0 / 100
1 ms212 KiB
#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<<"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+=1; 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...