QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#560597#8669. 正方形计数lyt_awa100 ✓3470ms3996kbC++141.5kb2024-09-12 16:48:412024-09-12 16:48:41

Judging History

你现在查看的是最新测评结果

  • [2024-09-12 16:48:41]
  • 评测
  • 测评结果：100
  • 用时：3470ms
  • 内存：3996kb
查看
  • [2024-09-12 16:48:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10, V = 2000;

int n, x[15], y[15], l[N], r[N];
double zl[N], zr[N];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) scanf("%d%d", x + i, y + i);
    for (int i = 0; i <= V; ++i) zl[i] = V, zr[i] = 0;
    for (int i = 0; i < n; ++i) {
        int sx = x[i], sy = y[i], tx = x[(i + 1) % n], ty = y[(i + 1) % n];
        if (sx == tx) { zl[sx] = min(zl[sx], 1. * min(sy, ty)), zr[sx] = max(zr[sx], 1. * max(sy, ty)); continue; }
        if (sx > tx) swap(sx, tx), swap(sy, ty);
        double k = 1. * (ty - sy) / (tx - sx);
        for (int j = sx; j <= tx; ++j) {
            double v = sy + k * (j - sx);
            zl[j] = min(zl[j], v), zr[j] = max(zr[j], v);
        }
    }
    int L = V, R = 0;
    for (int i = 0; i <= V; ++i) {
        l[i] = ceil(zl[i]), r[i] = floor(zr[i]);
        if (l[i] <= r[i]) L = min(L, i), R = max(R, i);
    }
    int lim = max(*max_element(x, x + n) - *min_element(x, x + n), *max_element(y, y + n) - *min_element(y, y + n));
    long long ans = 0;
    for (int a = 0; a <= lim; ++a)
        for (int b = 1; a + b <= lim; ++b)
            for (int i = L; i + a + b <= R; ++i) {
                int ql = max({l[i], l[i + a] - b, l[i + b] + a, l[i + a + b] - b + a});
                int qr = min({r[i], r[i + a] - b, r[i + b] + a, r[i + a + b] - b + a});
                if (ql <= qr) ans += qr - ql + 1;
            }
    printf("%lld\n", ans);
    return 0;
}
源文件, 语言: C++14

详细

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 2432ms
memory: 3924kb

input:

4
131 603
131 1828
1919 1828
1919 603

output:

361182910200

result:

ok 1 number(s): "361182910200"

Test #2:

score: 10
Accepted
time: 1ms
memory: 3832kb

input:

4
239 211
239 962
261 962
261 211

output:

1498772

result:

ok 1 number(s): "1498772"

Test #3:

score: 10
Accepted
time: 3470ms
memory: 3988kb

input:

4
0 0
0 2000
2000 2000
2000 0

output:

1336001667000

result:

ok 1 number(s): "1336001667000"

Test #4:

score: 10
Accepted
time: 99ms
memory: 3912kb

input:

4
36 771
36 786
672 786
672 771

output:

427720

result:

ok 1 number(s): "427720"

Test #5:

score: 10
Accepted
time: 4ms
memory: 3840kb

input:

4
0 100
100 200
200 100
100 0

output:

34001650

result:

ok 1 number(s): "34001650"

Subtask #2:

score: 25
Accepted

Test #6:

score: 25
Accepted
time: 2345ms
memory: 3928kb

input:

3
131 603
131 1828
1919 603

output:

63739309181

result:

ok 1 number(s): "63739309181"

Test #7:

score: 25
Accepted
time: 1ms
memory: 3908kb

input:

3
239 211
239 962
261 211

output:

353073

result:

ok 1 number(s): "353073"

Test #8:

score: 25
Accepted
time: 3296ms
memory: 3996kb

input:

3
0 0
0 2000
2000 0

output:

222889277611

result:

ok 1 number(s): "222889277611"

Test #9:

score: 25
Accepted
time: 104ms
memory: 3800kb

input:

3
36 771
36 786
672 771

output:

98847

result:

ok 1 number(s): "98847"

Test #10:

score: 25
Accepted
time: 0ms
memory: 3992kb

input:

3
0 0
0 100
100 0

output:

1473186

result:

ok 1 number(s): "1473186"

Subtask #3:

score: 15
Accepted

Test #11:

score: 15
Accepted
time: 0ms
memory: 3904kb

input:

8
0 13
4 15
15 15
15 6
13 1
12 0
5 0
0 6

output:

4047

result:

ok 1 number(s): "4047"

Test #12:

score: 15
Accepted
time: 0ms
memory: 3992kb

input:

8
0 4
1 15
2 15
15 14
15 4
14 0
1 0
0 2

output:

4200

result:

ok 1 number(s): "4200"

Test #13:

score: 15
Accepted
time: 0ms
memory: 3840kb

input:

5
7 15
15 13
15 0
3 0
0 15

output:

3635

result:

ok 1 number(s): "3635"

Test #14:

score: 15
Accepted
time: 0ms
memory: 3992kb

input:

8
0 12
2 14
7 15
13 15
15 10
15 1
8 0
0 0

output:

4511

result:

ok 1 number(s): "4511"

Test #15:

score: 15
Accepted
time: 0ms
memory: 3908kb

input:

6
0 11
3 15
7 15
15 12
10 0
0 0

output:

3006

result:

ok 1 number(s): "3006"

Test #16:

score: 15
Accepted
time: 0ms
memory: 3856kb

input:

5
0 0
0 2
1 2
2 1
2 0

output:

4

result:

ok 1 number(s): "4"

Subtask #4:

score: 20
Accepted

Dependency #3:

100%
Accepted

Test #17:

score: 20
Accepted
time: 13ms
memory: 3996kb

input:

8
49 299
144 300
300 260
250 15
115 0
30 0
23 19
0 85

output:

443602646

result:

ok 1 number(s): "443602646"

Test #18:

score: 20
Accepted
time: 12ms
memory: 3908kb

input:

8
0 133
103 300
130 300
257 294
297 227
300 150
277 40
161 4

output:

351466521

result:

ok 1 number(s): "351466521"

Test #19:

score: 20
Accepted
time: 12ms
memory: 3920kb

input:

8
76 286
114 300
300 300
300 205
291 0
47 0
4 57
2 235

output:

605026927

result:

ok 1 number(s): "605026927"

Test #20:

score: 20
Accepted
time: 13ms
memory: 3928kb

input:

8
0 102
40 274
282 300
300 234
267 0
34 0
6 57
0 86

output:

497330741

result:

ok 1 number(s): "497330741"

Test #21:

score: 20
Accepted
time: 12ms
memory: 3840kb

input:

7
0 288
156 300
212 300
265 176
300 86
278 0
0 36

output:

446722651

result:

ok 1 number(s): "446722651"

Subtask #5:

score: 15
Accepted

Dependency #4:

100%
Accepted

Test #22:

score: 15
Accepted
time: 188ms
memory: 3920kb

input:

5
257 800
766 800
800 353
667 0
42 0

output:

18881369614

result:

ok 1 number(s): "18881369614"

Test #23:

score: 15
Accepted
time: 207ms
memory: 3840kb

input:

8
691 800
737 795
800 651
372 98
136 266
118 318
24 629
12 753

output:

8760058886

result:

ok 1 number(s): "8760058886"

Test #24:

score: 15
Accepted
time: 171ms
memory: 3912kb

input:

8
718 800
740 800
800 726
800 670
711 367
595 150
86 0
57 136

output:

3064355626

result:

ok 1 number(s): "3064355626"

Test #25:

score: 15
Accepted
time: 222ms
memory: 3860kb

input:

8
0 347
16 449
364 798
674 800
750 800
797 14
195 0
0 70

output:

23587042437

result:

ok 1 number(s): "23587042437"

Test #26:

score: 15
Accepted
time: 223ms
memory: 3904kb

input:

8
322 800
596 800
686 777
800 280
764 69
396 0
46 179
0 660

output:

23185884331

result:

ok 1 number(s): "23185884331"

Subtask #6:

score: 15
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

100%
Accepted

Dependency #5:

100%
Accepted

Test #27:

score: 15
Accepted
time: 2416ms
memory: 3844kb

input:

8
0 1150
314 2000
1101 2000
1617 1607
1778 551
738 0
607 10
0 1011

output:

577130875850

result:

ok 1 number(s): "577130875850"

Test #28:

score: 15
Accepted
time: 3302ms
memory: 3996kb

input:

8
0 1841
1526 2000
1981 1680
1968 678
1893 26
973 0
616 315
524 434

output:

735496008519

result:

ok 1 number(s): "735496008519"

Test #29:

score: 15
Accepted
time: 3468ms
memory: 3804kb

input:

6
0 258
10 2000
1730 2000
2000 1510
1973 0
0 129

output:

1203935109430

result:

ok 1 number(s): "1203935109430"

Test #30:

score: 15
Accepted
time: 3454ms
memory: 3992kb

input:

7
200 2000
1686 2000
1951 1878
2000 863
1422 0
21 0
0 1015

output:

1100462975231

result:

ok 1 number(s): "1100462975231"

Test #31:

score: 15
Accepted
time: 3443ms
memory: 3840kb

input:

8
701 2000
1449 2000
1847 1928
2000 1496
1987 668
1588 108
263 0
0 1985

output:

997591862206

result:

ok 1 number(s): "997591862206"

Test #32:

score: 15
Accepted
time: 3277ms
memory: 3908kb

input:

8
15 2000
1235 2000
1545 1886
1970 1526
1828 427
1238 97
372 0
0 1786

output:

816089046494

result:

ok 1 number(s): "816089046494"

Test #33:

score: 15
Accepted
time: 3420ms
memory: 3912kb

input:

7
0 1685
1331 2000
2000 1941
2000 1310
1757 631
21 113
0 575

output:

633230324466

result:

ok 1 number(s): "633230324466"

Test #34:

score: 15
Accepted
time: 3447ms
memory: 3996kb

input:

8
0 650
0 1350
650 2000
1350 2000
2000 1350
2000 650
1350 0
650 0

output:

900037062925

result:

ok 1 number(s): "900037062925"
English 繁體中文 简体中文

服务器时间: 2024-12-05 08:36:17 | 开源项目