QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#625214 | #7733. Cool, It’s Yesterday Four Times More | qinglu09# | AC ✓ | 447ms | 8888kb | C++14 | 2.1kb | 2024-10-09 17:57:32 | 2024-10-09 17:57:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(x) (x&-x)
#define gcd __gcd
#define i128 __int128
#define rep(i, a, b) for(ll i = (a); i <= (b); i++)
#define per(i, a, b) for(ll i = (a); i >= (b); i--)
const int N=1e6+10,M=3e6+10;
const ll mod=1e9+7;
const ld eps=1e-12;
const double pi=acos(-1.0);
const double pi1=pi/180,pi2=180/pi;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//unordered_map<int,int>mp;
#define poly vector<int>
bitset<8005>space[1005],now;
int diff=1001;
int movex[4]={0,0,1,-1};
int movey[4]={1,-1,0,0};
int val[4]={1,-1,0,0};
int vis[1005][1005];
char a[1005][1005];
void solve()
{
int n,m;
cin>>n>>m;
for(int i=0;i<n*m;i++) space[i].reset();
val[2] = 2 * m;
val[3] = -2 * m;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cin>>a[i][j];
}
}
function<void(int,int,int,int)>dfs=[&](int id, int x,int y,int pos)
{
space[id][pos]=1;
for(int i=0;i<4;i++)
{
int X=x+movex[i];
int Y=y+movey[i];
if(X>=0&&X<n&&Y>=0&&Y<m&&!vis[X][Y]&&a[X][Y]=='.')
{
vis[X][Y]=1;
dfs(id, X, Y, pos + val[i]);
}
}
};
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(a[i][j]=='.')
{
for(int x=0;x<n;x++)
{
for(int y=0;y<m;y++)
{
vis[x][y]=0;
}
}
vis[i][j]=1;
dfs(i*m+j,i,j,4002);
}
}
}
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(a[i][j]=='.')
{
bool ok = 1;
for(int x=0;x<n;x++)
{
for(int y=0;y<m;y++)
{
if(x==i&&j==y) continue;
if(a[x][y] != '.') continue;
now=space[i*m+j]|space[x*m+y];
if(now==space[x*m+y]) {
ok = 0;
break;
}
}
if(!ok) break;
}
if(ok) ans++;
}
}
}
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int T=1;
cin>>T;
while(T--)
{
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5620kb
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: 2ms
memory: 7904kb
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: 6ms
memory: 5948kb
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: 68ms
memory: 5536kb
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: 2ms
memory: 5916kb
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: 8ms
memory: 3776kb
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: 60ms
memory: 7020kb
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: 112ms
memory: 5604kb
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: 447ms
memory: 6960kb
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: 173ms
memory: 6076kb
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: 427ms
memory: 8784kb
input:
5 2 500 .....................................................................................................................................................................O.................................................................................................................................
output:
996 994 992 990 988
result:
ok 5 lines
Test #12:
score: 0
Accepted
time: 415ms
memory: 5772kb
input:
5 2 500 .........................................................................................................................................................................................................................................................O.............................................
output:
997 995 993 991 989
result:
ok 5 lines
Test #13:
score: 0
Accepted
time: 209ms
memory: 8240kb
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: 138ms
memory: 6888kb
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: 128ms
memory: 6920kb
input:
5 3 333 .......................................................................................................................................................................................................................................................................................................
output:
333 333 333 333 333
result:
ok 5 lines
Test #16:
score: 0
Accepted
time: 2ms
memory: 6440kb
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: 186ms
memory: 4724kb
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: 434ms
memory: 8888kb
input:
5 2 499 .........................................................................................................................................................................................................................................................O.............................................
output:
994 994 990 990 986
result:
ok 5 lines
Extra Test:
score: 0
Extra Test Passed