QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#279027 | #7733. Cool, It’s Yesterday Four Times More | Freeuni1# | RE | 1ms | 5640kb | C++17 | 2.4kb | 2023-12-08 02:20:52 | 2023-12-08 02:20:53 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define MAXA(x, y) (x) = ((x) > (y)) ? (x) : (y)
#define MINA(x, y) (x) = ((x) < (y)) ? (x) : (y)
#define MAX(x, y) ((x) > (y)) ? (x) : (y)
#define MIN(x, y) ((x) < (y)) ? (x) : (y)
#define ADD(x, y, mod) (x) = (((x)+(y) >= (mod)) ? ((x)+(y) - (mod)) : (((x)+(y) < 0) ? ((x)+(y)+(mod)) : ((x)+(y))) )
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define count1(x) __builtin_popcount(x)
#define endl '\n'
using namespace std;
// lllllllllllll
const int N = 102;
char A[1005][1005];
int n, m;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int fix[1005][1005];
bitset<4000>bt[1001];
int base;
void dfs(int x, int y, int a, int b){
int val = (x-a)*(2*m-1) + (y-b) - base;
int ind = a*m + b;
bt[ind][val] = 1;
fix[x][y] = 1;
//cout << x << " " << y << " " << a << " " << b << " " << val << endl;
for(int i = 0; i < 4; i++){
int nx = dx[i] + x;
int ny = dy[i] + y;
if(nx < 0 || nx >= n || ny < 0 || ny >= m || fix[nx][ny] == 1 || A[nx][ny] == 'O') continue;
dfs(nx, ny, a, b);
}
}
void test_case(){
cin >> n >> m;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin >> A[i][j];
}
}
base = (1-n)*(2*m-1) + (1-n);
for(int i = 0; i < n*m; i++){
bt[i] = 0;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(A[i][j] == '.'){
dfs(i, j, i, j);
}
for(int t = 0; t < n; t++){
fill(fix[t], fix[t] + m, 0);
}
}
}
int answer = 0;
for(int i = 0; i < n*m; i++){
if(A[i/m][i%m] != '.') continue;
bool ok = true;
for(int j = 0; j < n*m; j++){
if(A[j/m][j%m] != '.') continue;
if(i == j) continue;
if((bt[i] | bt[j]) == bt[j]){
//cout << i << " " << j << endl;
ok = false;
break;
}
}
if(ok) answer++;
}
cout << answer << endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1;
cin >> t;
while(t--){
test_case();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5640kb
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: -100
Runtime Error
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. ...