QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#123208 | #1811. How to Move the Beans | EastKing | WA | 2ms | 8064kb | C++17 | 3.1kb | 2023-07-11 21:11:55 | 2023-07-11 21:11:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[1005][2005];
int R[1005][2005],L[1005][2005];
int STL[1005][11][4];
int STR[1005][11][4];
int dp[1005][1005];
int mex(int x=4,int y=4,int z=4){
for(int i=0;i<=4;i++){
if(x!=i&&y!=i&&z!=i)return i;
}
}
int main(){
int H,W;
scanf("%d%d",&H,&W);
for(int i=0;i<H;i++){
scanf("%s",s[i]);
}
for(int j=0;j<W;j++)s[H][j]='.';
for(int i=0;i<=H;i++){
for(int j=0;j<W;j++){
if(s[i][j]=='#')s[i][j]='.';
else if(s[i][j]=='.')s[i][j]='#';
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++)s[i][j+W]='.';
for(int j=0;j<2*W;j++){
if(s[i][j%W]!='.')L[i][j%W]=max(1,L[i][(j-1+W)%W]+1);
else L[i][j%W]=0;
if(L[i][j%W]>W)L[i][j%W]=W;
}
for(int j=2*W-1;j>=0;j--){
if(s[i][j%W]!='.')R[i][j%W]=max(1,R[i][(j+1)%W]+1);
else R[i][j%W]=0;
if(R[i][j%W]>W)R[i][j%W]=W;
}
}
int ans=0;
for(int i=H-1;i>=0;i--){
memset(STL,0,sizeof(STL));
memset(STR,0,sizeof(STR));
for(int j=0;j<W;j++){
for(int l=0;l<=3;l++){
if(s[i+1][j]=='.'){
STL[j][0][l]=mex(l);
STR[j][0][l]=mex(l);
}else{
STL[j][0][l]=mex(dp[i+1][j],l);
STR[j][0][l]=mex(dp[i+1][j],l);
}
}
}
for(int k=1;k<=10;k++){
for(int j=0;j<W;j++){
for(int l=0;l<=3;l++){
STL[j][k][l]=STL[(j-(1<<(k-1))+W)%W][k-1][STL[j][k-1][l]];
STR[j][k][l]=STR[(j+(1<<(k-1))+W)%W][k-1][STR[j][k-1][l]];
}
}
}
//calc dp[i][j] len R[i][j]-1
auto calcL=[&](int dis,int len){
int ans=3;
for(int j=10;j>=0;j--){
if((len>>j)&1){
ans=STL[dis][j][ans];
dis=(dis-(1<<j)%W+W)%W;
}
}
return ans;
};
auto calcR=[&](int dis,int len){
int ans=3;
for(int j=10;j>=0;j--){
if((len>>j)&1){
ans=STR[dis][j][ans];
dis=(dis+(1<<j)+W)%W;
}
}
return ans;
};
for(int j=0;j<W;j++){
if(s[i][j]!='.'){
int d1=4,d2=4,d3=4;
if(s[i+1][j]!='.'){
d1=dp[i+1][j];
}
if(R[i][j]>1){
d2=calcL((i+R[i][j]-1+W)%W,R[i][j]-1);
}
if(L[i][j]>1){
d3=calcR((i-L[i][j]+1+W)%W,L[i][j]-1);
}
dp[i][j]=mex(d1,d2,d3);
}
//printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(s[i][j]=='B')ans^=dp[i][j];
}
}
if(ans==0)printf("Bob");
else printf("Alice");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 8064kb
input:
2 3 B.# #..
output:
Alice
result:
ok "Alice"
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 5976kb
input:
1 1 B
output:
Alice
result:
wrong answer 1st words differ - expected: 'Bob', found: 'Alice'