QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#276895 | #7733. Cool, It’s Yesterday Four Times More | junit | TL | 385ms | 8296kb | C++14 | 2.5kb | 2023-12-06 12:22:39 | 2023-12-06 12:22:40 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e3+4;
bitset<4003>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;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3692kb
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: 3ms
memory: 7772kb
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: 0
Accepted
time: 18ms
memory: 7756kb
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:
31 40 13 25 40 37 27 29 20 26 25 29 21 29 21 31 32 31 33 34 25 31 18 25 41 28 20 45 20 29 18 21 27 28 35 13 20 17 32 29 28 23 23 23 24 18 28 17 35 24
result:
ok 50 lines
Test #4:
score: 0
Accepted
time: 272ms
memory: 6408kb
input:
5 1 1000 ....O..OO..O..O..OO...OOO.OOOO.O...O....OOOOO.....OO..OOOO.O..O....OOOO..OO..OOOO......O.O.O..O..OO.OO.OO.O....O.O.O.O.O.OO..O.O.OO..O..OO..O.OOO...O...O.O.O..O....O.OO...O..O...O.OOO..OO.O..O.OO.O.O..OOOO..O.OO.O.O....O.OO.......OOOO....O.O.O.O..OOO.O.OO.OOO..O...O.O.O.O.OO.O.OOOO...O.OO.....
output:
7 380 294 373 291
result:
ok 5 lines
Test #5:
score: 0
Accepted
time: 3ms
memory: 5936kb
input:
200 1 1 . 2 5 OOOO. OOOOO 3 2 O. O. OO 3 1 O . O 3 2 .. OO OO 1 5 ...OO 3 5 OOOOO OOOOO OOO.O 4 3 OOO OOO OO. OO. 1 3 O.O 3 1 O . . 1 2 O. 3 3 OOO O.. ... 5 4 O.OO ..OO O.OO OOOO OOOO 2 2 O. OO 3 2 OO OO O. 4 4 OOO. OO.. OO.O ...O 1 4 .OOO 4 3 O.. OOO OOO OOO 4 1 O . . O 3 2 O. OO OO 5 3 OO. OOO OOO...
output:
1 1 2 1 2 3 1 2 1 2 1 5 4 1 1 7 1 2 2 1 1 6 0 1 1 5 1 1 2 1 3 8 1 2 1 3 2 10 4 1 3 1 2 1 1 1 1 1 2 1 1 2 2 4 3 1 2 7 4 1 4 1 1 1 2 1 2 1 7 1 1 1 1 1 3 1 1 2 4 1 4 1 1 1 1 1 1 1 1 1 3 7 1 1 2 5 1 3 7 1 9 2 9 4 4 0 12 6 4 6 2 0 8 6 3 4 16 5 4 5 2 7 1 0 0 1 4 2 9 0 2 3 7 6 13 7 10 11 4 2 13 5 8 8 0 16 ...
result:
ok 200 lines
Test #6:
score: 0
Accepted
time: 25ms
memory: 5968kb
input:
50 7 9 OOOOOOO.. OOOOOOO.. OOO....OO ....OO..O .O...OOOO .....OOOO OO...OOOO 8 8 .OO.O... .O...... OOO.OOOO OO..OOOO ..O.OO.O O...OOOO O..OOOOO O..OOOOO 9 8 OO....OO OO..OOOO O..OOOOO ..O..OOO .....O.. .....O.. OOOOOOOO OOOOOOOO .OOOOOOO 8 10 .O.OOOOOOO ...OO.OOOO ......OOOO O..O....OO O..OOO.O.O O....
output:
22 23 22 35 33 15 21 23 24 16 29 15 29 40 23 30 6 25 37 23 25 33 19 12 34 43 44 21 51 29 35 67 22 53 33 53 32 46 50 48 42 45 31 46 45 30 48 53 54 43
result:
ok 50 lines
Test #7:
score: 0
Accepted
time: 196ms
memory: 5144kb
input:
5 1 1000 OO.OOO....O..OOOO..OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOO....OOOOOOOOOOOO...OO.OOOOOOOOOOOO.OOOOOOO....OOOOOOO......OOOOOOOOOOOOOOOOOOOOOOOO..OOO.O.OO..OO....OOOOOOOOO.OO.OOOOO.OOOOOOO....OOOOOOOO.OOOOO...OOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOOOOOOO.....
output:
0 355 363 384 280
result:
ok 5 lines
Test #8:
score: 0
Accepted
time: 385ms
memory: 8296kb
input:
5 1 1000 O.O...O................OOOO........OO..........OOOO....OO...O...OO....O...OO...O.............OOOOOO......................OOO......OO..........O...............O........................OO....................O..........O..........OO.......OOOO.O..OO...OOO....O.................................O...
output:
34 458 503 370 493
result:
ok 5 lines
Test #9:
score: -100
Time Limit Exceeded
input:
5 1 1000 O......OOO..O..OO.OO..................................................................................................................................................................................................................................................................................
output:
966 963 971