QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#318797 | #7733. Cool, It’s Yesterday Four Times More | amirali_asgari# | AC ✓ | 6ms | 3760kb | C++20 | 2.7kb | 2024-01-31 20:34:34 | 2024-01-31 20:34:34 |
Judging History
answer
// In the name of Allah
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<ld> cld;
#define all(x) (x).begin(),(x).end()
#define len(x) ((ll) (x).size())
#define F first
#define S second
#define X real()
#define Y imag()
#define pb push_back
#define sep ' '
#define endl '\n'
#define Mp make_pair
#define kill(x) cout << x << '\n', exit(0)
#define set_dec(x) cout << fixed << setprecision(x);
#define file_io(x,y) freopen(x, "r", stdin); freopen(y, "w", stdout);
int n, m;
const int maxn = 1e6 + 4;
vector<char> s[maxn]; int M[maxn];
int mark[maxn], col[maxn], c = 0;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
vector<pii> A[maxn];
int GI(int i, int j) {
return (i * m + j);
}
pii Gp(int v) {
return Mp(v / m, v % m);
}
void dfs(int v) {
auto f = Gp(v);
int x = f.F, y = f.S;
mark[v] = 1; col[v] = c; A[c].pb(Mp(x, y));
for (int T = 0; T < 4; T++) {
int x1 = x + dx[T], y1 = y + dy[T];
if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && s[x1][y1] == '.') {
int u = GI(x1, y1);
if (!mark[u]) dfs(u);
}
}
}
bool ok(int i, int j) {
auto f = A[i][0];
for (auto g : A[j]) {
pii d = Mp(g.F - f.F, g.S - f.S);
bool flag = 1;
for (auto r : A[i]) {
int x1 = r.F + d.F, y1 = r.S + d.S;
if (!(x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && col[GI(x1, y1)] == j)) {
flag = 0;
break;
}
}
if (flag) return 1;
}
return 0;
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int T;
cin >> T;
while (T--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
s[i].clear(); s[i].resize(m);
for (int j = 0; j < m; j++) cin >> s[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int v = GI(i, j);
col[v] = -1;
}
}
fill(mark, mark + (n * m), 0); c = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i][j] != '.') continue;
int v = GI(i, j);
if (!mark[v]) {
A[c].clear();
dfs(v); c++;
}
}
}
fill(M, M + c, 1);
for (int i = 0; i < c; i++) {
for (int j = i + 1; j < c; j++) {
if (len(A[i]) == len(A[j])) {
if (ok(i, j)) {
M[i] = 0; M[j] = 0;
}
}
else if (len(A[i]) > len(A[j])) {
if (ok(j, i)) M[j] = 0;
}
else {
if (ok(i, j)) M[i] = 0;
}
}
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (s[i][j] != '.') continue;
int v = GI(i, j);
if (M[col[v]]) res++;
}
}
cout << res << endl;
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3628kb
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: 0ms
memory: 3656kb
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: 2ms
memory: 3644kb
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: 3588kb
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: 3664kb
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: 3ms
memory: 3692kb
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: 3ms
memory: 3704kb
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: 2ms
memory: 3724kb
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: 0ms
memory: 3684kb
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: 3ms
memory: 3648kb
input:
5 2 500 .....................................................................................................................................................................O.................................................................................................................................
output:
996 994 992 990 988
result:
ok 5 lines
Test #12:
score: 0
Accepted
time: 3ms
memory: 3656kb
input:
5 2 500 .........................................................................................................................................................................................................................................................O.............................................
output:
997 995 993 991 989
result:
ok 5 lines
Test #13:
score: 0
Accepted
time: 0ms
memory: 3660kb
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: 0ms
memory: 3668kb
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: 3ms
memory: 3760kb
input:
5 3 333 .......................................................................................................................................................................................................................................................................................................
output:
333 333 333 333 333
result:
ok 5 lines
Test #16:
score: 0
Accepted
time: 6ms
memory: 3700kb
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: 3ms
memory: 3644kb
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: 3ms
memory: 3712kb
input:
5 2 499 .........................................................................................................................................................................................................................................................O.............................................
output:
994 994 990 990 986
result:
ok 5 lines
Extra Test:
score: 0
Extra Test Passed