QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #628145 | #7733. Cool, It’s Yesterday Four Times More | strongduck | AC ✓ | 138ms | 42484kb | C++14 | 3.2kb | 2024-10-10 18:52:51 | 2024-10-10 18:52:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ak;
#define im INT_MAX
#define F(i,j,k) for(int i=j;i<=k;i++)
#define G(i,j,k) for(int i=j;i>=k;i--)
int cnt,xx,yy,n,m,mp[1111][1111],alive[1111];
struct posi{int x;int y;};
vector<posi>shape[1111][1111];
bool lpc(posi i,posi j){
return i.x==j.x?(i.y<j.y):(i.x<j.x);
}
void zmg(int x,int y,int ox,int oy,int ord){
mp[x][y]=ord;posi tmp;tmp.x=ox,tmp.y=oy;
shape[xx][yy].push_back(tmp);
if(mp[x][y-1]==-1)zmg(x,y-1,ox,oy-1,ord);
if(mp[x][y+1]==-1)zmg(x,y+1,ox,oy+1,ord);
if(mp[x-1][y]==-1)zmg(x-1,y,ox-1,oy,ord);
if(mp[x+1][y]==-1)zmg(x+1,y,ox+1,oy,ord);
return;
}
void gmz(int x,int y,int ox,int oy,int ord){
posi tmp;tmp.x=ox,tmp.y=oy;
shape[xx][yy].push_back(tmp);
mp[x][y]=0;
if(mp[x][y-1]==ord)gmz(x,y-1,ox,oy-1,ord);
if(mp[x][y+1]==ord)gmz(x,y+1,ox,oy+1,ord);
if(mp[x-1][y]==ord)gmz(x-1,y,ox-1,oy,ord);
if(mp[x+1][y]==ord)gmz(x+1,y,ox+1,oy,ord);
mp[x][y]=-1;
return;
}
void zzz(int x,int y,int ox,int oy,int ord){
mp[x][y]=ord;
if(mp[x][y-1]==-1)zzz(x,y-1,ox,oy-1,ord);
if(mp[x][y+1]==-1)zzz(x,y+1,ox,oy+1,ord);
if(mp[x-1][y]==-1)zzz(x-1,y,ox-1,oy,ord);
if(mp[x+1][y]==-1)zzz(x+1,y,ox+1,oy,ord);
return;
}
bool cxk(int vc,int vx,int vy,int kc,int kx,int ky){
F(i,0,shape[vx][vy].size()-1){
int dx=shape[vx][vy][i].x;
int dy=shape[vx][vy][i].y;
if((kx+dx<1)||(ky+dy<1))return 0;
if((kx+dx>n)||(ky+dy>m))return 0;
if(mp[kx+dx][ky+dy]!=kc)return 0;
}
return 1;
}
int main(){
ios::sync_with_stdio(0);
// freopen("1.txt","r",stdin);
int t;cin>>t;
F(fuck,1,t){
cin>>n>>m;
F(i,1,n)F(j,1,m){
while(shape[i][j].size())shape[i][j].pop_back();
}
F(i,1,n){
string s;cin>>s;
F(j,0,m-1)mp[i][j+1]=0-(s[j]=='.');
}
F(j,0,m+1)mp[0][j]=mp[n+1][j]=0;
F(i,0,n+1)mp[i][0]=mp[i][m+1]=0;
cnt=0;
F(i,1,n)F(j,1,m){
xx=i,yy=j;int tmp;
if(mp[i][j]==-1)zmg(i,j,0,0,++cnt);
else if(mp[i][j])
tmp=mp[i][j],gmz(i,j,0,0,mp[i][j]),zzz(i,j,0,0,tmp);
}
// F(i,1,n){
// F(j,1,m)cout<<mp[i][j];
// cout<<"\n";
// }
//
// cout<<"cnt = "<<cnt<<"\n";
// F(i,1,n)F(j,1,m)
// sort(shape[i][j],shape[i][j]+shape[i][j].size(),lpc);
F(i,1,cnt)alive[i]=1;alive[0]=0;
F(k,1,cnt){
int sx,sy;
F(i,1,n){
bool flg=0;
F(j,1,m)if(mp[i][j]==k){
sx=i,sy=j;flg=1;break;
}
if(flg)break;
}
F(i,1,n){
bool flg=0;
F(j,1,m){
if((mp[i][j]==k)||(mp[i][j]==0))continue;
// if(alive[mp[i][j]]==0)continue;
if(cxk(k,sx,sy,mp[i][j],i,j)){
alive[k]=0;flg=1;break;
}
}
if(flg)break;
}
// if(k==k)return 114514;
}
int ans=0;
F(i,1,n)F(j,1,m)if(alive[mp[i][j]])ans++;
cout<<ans<<"\n";
}
return 0;
}
/*
4
2 5
.OO..
O..O.
1 3
O.O
1 3
.O.
2 3
OOO
OOO
5
2 5
.OO..
O..O.
6 7
OO..OOO
OOO..O.
O..OOO.
OO..O.O
.OOO..O
O...O..
3 3
OOO
OOO
OOO
2 2
..
..
2 3
OOO
.O.
1 2 3
OOO
.O.
40
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
20 6
*/
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 6ms
memory: 33344kb
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: 34132kb
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: 3ms
memory: 34216kb
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: 4ms
memory: 36540kb
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: 10ms
memory: 32764kb
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: 3ms
memory: 34144kb
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: 13ms
memory: 35108kb
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: 11ms
memory: 37064kb
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: 0
Accepted
time: 138ms
memory: 40324kb
input:
5 1 1000 O......OOO..O..OO.OO..................................................................................................................................................................................................................................................................................
output:
966 963 971 965 963
result:
ok 5 lines
Test #10:
score: 0
Accepted
time: 50ms
memory: 35136kb
input:
5 5 200 ........................................................................................................................................................................................................ .....OO...OO.OO.O..O..O.OO.OO.OOO.O.OOO...OO.OO...O.O.OO.O.O...OO..OOO..OOOOOOO.OO.O..O.O.O...
output:
508 502 508 499 506
result:
ok 5 lines
Test #11:
score: 0
Accepted
time: 87ms
memory: 40236kb
input:
5 2 500 .....................................................................................................................................................................O.................................................................................................................................
output:
996 994 992 990 988
result:
ok 5 lines
Test #12:
score: 0
Accepted
time: 75ms
memory: 37080kb
input:
5 2 500 .........................................................................................................................................................................................................................................................O.............................................
output:
997 995 993 991 989
result:
ok 5 lines
Test #13:
score: 0
Accepted
time: 53ms
memory: 40252kb
input:
5 333 3 .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. ...
output:
667 667 667 667 667
result:
ok 5 lines
Test #14:
score: 0
Accepted
time: 30ms
memory: 36556kb
input:
5 200 5 .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O...
output:
401 401 401 401 401
result:
ok 5 lines
Test #15:
score: 0
Accepted
time: 35ms
memory: 35812kb
input:
5 3 333 .......................................................................................................................................................................................................................................................................................................
output:
333 333 333 333 333
result:
ok 5 lines
Test #16:
score: 0
Accepted
time: 7ms
memory: 34612kb
input:
5 2 500 O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O....
output:
0 0 0 0 0
result:
ok 5 lines
Test #17:
score: 0
Accepted
time: 8ms
memory: 34316kb
input:
5 6 160 ...O..O......O...O..O......O......O.O.O..O......O......O......O......O......O.....OO.O.O..O...O..O..O...O.OO..OO......O....O.O.....OO......O....O.OO..OO.O...... .O....O......O.O....O......O......O...OO.O......O.O.O..O......O......O......O......O......OO...O.O.OO...O......O......O......OO.......
output:
36 570 743 694 682
result:
ok 5 lines
Test #18:
score: 0
Accepted
time: 80ms
memory: 42484kb
input:
5 2 499 .........................................................................................................................................................................................................................................................O.............................................
output:
994 994 990 990 986
result:
ok 5 lines
Extra Test:
score: 0
Extra Test Passed