QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#697931 | #7733. Cool, It’s Yesterday Four Times More | ucup-team3474 | TL | 166ms | 7296kb | C++20 | 2.6kb | 2024-11-01 16:28:01 | 2024-11-01 16:28:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
ll n,m,k;
char s[1010][1010];
int tf[1010][1010];
map<array<int,4>,int> mp;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int dfs(int x,int y,int xx,int yy){
array<int,4> a4={x,y,xx,yy};
if(mp.count(a4)) return mp[a4];
if(tf[x][y]==1&&tf[xx][yy]==0){
mp[a4]=1;
return 1;
}
if(tf[x][y]==0){
mp[a4]=0;
return 0;
}
mp[a4]=0;
for(int i=0;i<4;i++){
int ux=x+dx[i],uy=y+dy[i];
int uxx=xx+dx[i],uyy=yy+dy[i];
mp[a4]=max(mp[a4],dfs(ux,uy,uxx,uyy));
cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<" "<<dfs(ux,uy,uxx,uyy)<<endl;
}
// cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<" "<<mp[a4]<<endl;
return mp[a4];
}
void bfs(){
queue<array<int,4>> q;
for(auto [x,y]:mp) if(y==1) q.push(x);
while(q.size()){
auto t=q.front();
q.pop();
for(int i=0;i<4;i++){
int x=t[0]+dx[i],y=t[1]+dy[i],xx=t[2]+dx[i],yy=t[3]+dy[i];
if(!mp.count({x,y,xx,yy})&&x>=0&&y>=0&&x<=n+1&&y<=m+1&&xx>=0&&yy>=0&&xx<=n+1&&yy<=m+1){
mp[{x,y,xx,yy}]=1;
q.push({x,y,xx,yy});
}
}
}
}
void __(){
scanf("%lld%lld",&n,&m);
mp.clear();
for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
for(int i=0;i<=n+1;i++){
for(int j=0;j<=m+1;j++){
tf[i][j]=0;
}
}
vector<PII> v;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(s[i][j]=='O') tf[i][j]=0;
else{
v.push_back({i,j});
tf[i][j]=1;
}
}
}
int ans=0;
for(int i=0;i<=n+1;i++){
for(int j=0;j<=m+1;j++){
for(int ii=0;ii<=n+1;ii++){
for(int jj=0;jj<=m+1;jj++){
if(tf[i][j]==1&&tf[ii][jj]==0) mp[{i,j,ii,jj}]=1;
if(tf[i][j]==0) mp[{i,j,ii,jj}]=0;
}
}
}
}
bfs();
for(int i=0;i<v.size();i++){
int flag=1;
for(int j=0;j<v.size();j++){
if(i==j) continue;
array<int,4> a4={v[i].first,v[i].second,v[j].first,v[j].second};
// if(!dfs(v[i].first,v[i].second,v[j].first,v[j].second)) flag=0;
if(!mp.count(a4)) flag=0;
}
ans+=flag;
}
printf("%d\n",ans);
}
signed main()
{
int _;
cin>>_;
while(_--){
__();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5908kb
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: 24ms
memory: 6324kb
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: 166ms
memory: 7296kb
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: -100
Time Limit Exceeded
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.....