QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#276891 | #7733. Cool, It’s Yesterday Four Times More | junit | WA | 2ms | 5600kb | C++14 | 2.5kb | 2023-12-06 12:21:28 | 2023-12-06 12:21:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+4;
bitset<50>bs[N];
int n,m,col[N][N],tot;
char mp[N][N];
int dx[]={0,-1,0,1};
int dy[]={1,0,-1,0};
bool check(int nx,int ny){
if(nx>=1&&nx<=n&&ny<=m&&ny>=1&&mp[nx][ny]=='.')return true;
return false;
}
void dfs(int x,int y){
col[x][y]=tot;
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(nx>=1&&nx<=n&&ny<=m&&ny>=1&&col[nx][ny]==0&&mp[nx][ny]=='.'){
dfs(nx,ny);
}
}
}
int get1(int x,int y){
return (x-1)*m+y-1;
}
int get2(int x,int y){
x+=n-1;y+=m-1;
return x*(2*m-1)+y;
}
void encode(int x,int y){
int val=get1(x,y);
bs[val].reset();
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(col[i][j]==col[x][y])
bs[val][get2(i-x,j-y)]=1;
}
}
}
bool in1(int v1,int v2){
if((bs[v2].count()!=(bs[v1]|bs[v2]).count()))return true;
return false;
}
int main(){
int T;
cin>>T;
while(T--){
cin>>n>>m;
tot=0;
for(int i=1;i<=n;i++){
scanf("%s",mp[i]+1);
for(int j=1;j<=m;j++){
col[i][j]=0;
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(col[i][j]==0&&mp[i][j]=='.'){
tot++;
dfs(i,j);
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
encode(i,j);
}
}
// cout<<bs[get1(1,4)].to_string()<<endl;
// cout<<bs[get1(2,3)].to_string()<<endl;
// if(in1(get1(1,4),get1(2,3)))
// printf("hh\n");
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(!check(i,j))continue;
//printf("%d %d\n",i,j);
bool flag=true;
for(int u=1;u<=n;u++){
for(int v=1;v<=m;v++){
if(check(u,v)){
if(u==i&&v==j)continue;
int v1=get1(i,j),v2=get1(u,v);
if(in1(v1,v2)){
}
else {
flag=false;
break;
}
}
}}
if(flag)ans++;
}}
cout<<ans<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5532kb
input:
4 2 5 .OO.. O..O. 1 3 O.O 1 3 .O. 2 3 OOO OOO
output:
3 1 0 0
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 5600kb
input:
200 2 4 OOO. OO.. 2 3 OOO .O. 3 3 O.O OOO OO. 4 1 . . O O 1 2 .O 1 1 . 2 5 .OO.. .O.O. 2 1 O O 1 1 O 1 3 .OO 5 1 O O . O . 5 2 O. .. O. .O .. 5 3 ... ... .OO ..O OOO 3 5 ..O.O .O.O. .OO.O 5 2 .O OO O. O. .. 2 1 O O 3 5 .O.OO O...O ..OO. 1 5 ..... 5 1 O . O . . 5 3 OOO OO. .OO OO. O.O 2 1 O . 5 2 O. ...
output:
3 0 0 2 1 1 3 0 0 1 0 7 9 4 4 0 6 5 2 0 1 6 4 5 2 0 0 5 3 3 1 4 1 0 7 5 2 3 7 3 0 6 2 2 2 0 4 6 6 3 3 2 3 5 2 1 0 3 3 4 4 2 2 0 7 6 4 8 5 3 2 5 2 1 2 1 4 0 0 2 5 1 4 6 6 1 6 2 2 3 4 5 2 1 0 1 9 3 4 11 0 3 2 1 0 0 4 3 1 4 3 8 3 0 3 6 2 5 1 3 3 4 0 2 11 2 2 4 0 4 4 6 2 1 2 3 0 5 0 16 4 3 2 6 0 8 3 3 1...
result:
ok 200 lines
Test #3:
score: -100
Wrong Answer
time: 2ms
memory: 5540kb
input:
50 10 9 OOOO.O... O...O.OOO .....O... ..OO..O.O ...O..O.O ..OOO..O. ..OOO...O .OO.O..OO .O.O.OO.. .O..O.O.O 10 10 .O.OOO.OO. ...OOOOOOO ...O.O..O. .O.O..O... .O.O.OO..O ..OO.O..OO O....O..OO OO...OOOOO OO.OO.O..O .O.O.OOOOO 10 8 O..OOO.O O.OOOO.. O..OO.OO OO..OO.. .OOO..O. .OO.OO.O OOO..OO. ..O..OO....
output:
25 40 13 25 30 31 27 29 20 26 25 21 21 25 21 31 32 17 33 34 17 16 18 25 21 28 20 37 20 19 18 21 27 26 35 13 20 17 22 29 28 19 13 23 24 18 20 11 35 24
result:
wrong answer 1st lines differ - expected: '31', found: '25'