QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#852458#8669. 正方形计数dewfw100 ✓2916ms3860kbC++143.2kb2025-01-11 11:57:482025-01-11 11:57:50

Judging History

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

  • [2025-01-11 11:57:50]
  • 评测
  • 测评结果：100
  • 用时：2916ms
  • 内存：3860kb
查看
  • [2025-01-11 11:57:48]
  • 提交

answer

#include <bits/stdc++.h>
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<std::pair<long long, long long>> d(n);
    for (int i = 0; i < n; ++i)
        std::cin >> d[i].first >> d[i].second;
    std::function<long long(long long, long long, long long, long long)> solve = [&](long long a, long long b, long long c, long long n) -> long long {
        if (a == 0)
            return b / c * (n + 1);
        if (a >= c || b >= c)
            return (a - (a % c + c) % c) / c * n * (n + 1) / 2 + (b - (b % c + c) % c) / c * (n + 1) + solve((a % c + c) % c, (b % c + c) % c, c, n);
        return (a * n + b) / c * n - solve(c, c - b - 1, a, (a * n + b) / c - 1);
    };
    std::vector<std::tuple<long long, long long, long long>> s;
    for (int i = 0; i < n; ++i)
        s.emplace_back(d[(i + 1) % n].second - d[i].second, -d[(i + 1) % n].first + d[i].first, d[(i + 1) % n].first * d[i].second - d[(i + 1) % n].second * d[i].first);
    long long cnt = 0;
    for (int i = 1; i <= 2000; ++i) {
        for (int j = 0; j <= 2000; ++j) {
            std::vector<std::tuple<long long, long long, long long>> e;
            for (auto [a, b, c] : s)
                e.emplace_back(a, b, std::min({c, c - a * i - b * j, c + a * j - b * i, c - a * i + a * j - b * j - b * i}));
            long long mx = 2000, mn = 0;
            for (auto [a, b, c] : e)
                if (b == 0 && a > 0)
                    mn = std::max(mn, (-c + a - 1) / a);
                else if (b == 0 && a < 0)
                    mx = std::min(mx, c / -a);
            for (auto [a, b, c] : e) {
                if (b > 0) {
                    long long mxx = mx, mnn = mn;
                    for (auto [aa, bb, cc] : e)
                        if (bb && aa * b - a * bb > 0)
                            mnn = std::max(mnn, (bb * c - b * cc + aa * b - a * bb - (bb < 0)) / (aa * b - a * bb));
                        else if (bb && aa * b - a * bb < 0)
                            mxx = std::min(mxx, (b * cc - bb * c) / (a * bb - aa * b));
                        else if (bb && b * cc - bb * c < 0)
                            mxx = -1, mnn = 2001;
                    if (mnn <= mxx)
                        cnt -= solve(-a, -c - 1, b, mxx) - (mnn ? solve(-a, -c - 1, b, mnn - 1) : 0);
                }
            }
            for (auto [a, b, c] : e) {
                if (b < 0) {
                    long long mxx = mx, mnn = mn;
                    for (auto [aa, bb, cc] : e)
                        if (bb && aa * b - a * bb > 0)
                            mxx = std::min(mxx, (bb * c - b * cc) / (aa * b - a * bb));
                        else if (bb && aa * b - a * bb < 0)
                            mnn = std::max(mnn, (b * cc - bb * c + a * bb - aa * b - (bb > 0)) / (a * bb - aa * b));
                        else if (bb && b * cc - bb * c > 0)
                            mxx = -1, mnn = 2001;
                    if (mnn <= mxx)
                        cnt += solve(a, c, -b, mxx) - (mnn ? solve(a, c, -b, mnn - 1) : 0);
                }
            }
        }
    }
    std::cout << cnt << '\n';
    return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 289ms
memory: 3624kb

input:

4
131 603
131 1828
1919 1828
1919 603

output:

361182910200

result:

ok 1 number(s): "361182910200"

Test #2:

score: 10
Accepted
time: 278ms
memory: 3508kb

input:

4
239 211
239 962
261 962
261 211

output:

1498772

result:

ok 1 number(s): "1498772"

Test #3:

score: 10
Accepted
time: 308ms
memory: 3564kb

input:

4
0 0
0 2000
2000 2000
2000 0

output:

1336001667000

result:

ok 1 number(s): "1336001667000"

Test #4:

score: 10
Accepted
time: 289ms
memory: 3560kb

input:

4
36 771
36 786
672 786
672 771

output:

427720

result:

ok 1 number(s): "427720"

Test #5:

score: 10
Accepted
time: 339ms
memory: 3624kb

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: 366ms
memory: 3860kb

input:

3
131 603
131 1828
1919 603

output:

63739309181

result:

ok 1 number(s): "63739309181"

Test #7:

score: 25
Accepted
time: 254ms
memory: 3564kb

input:

3
239 211
239 962
261 211

output:

353073

result:

ok 1 number(s): "353073"

Test #8:

score: 25
Accepted
time: 288ms
memory: 3820kb

input:

3
0 0
0 2000
2000 0

output:

222889277611

result:

ok 1 number(s): "222889277611"

Test #9:

score: 25
Accepted
time: 261ms
memory: 3820kb

input:

3
36 771
36 786
672 771

output:

98847

result:

ok 1 number(s): "98847"

Test #10:

score: 25
Accepted
time: 259ms
memory: 3848kb

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: 679ms
memory: 3568kb

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: 672ms
memory: 3628kb

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: 441ms
memory: 3788kb

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: 672ms
memory: 3528kb

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: 593ms
memory: 3852kb

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: 404ms
memory: 3860kb

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: 975ms
memory: 3628kb

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: 984ms
memory: 3620kb

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: 809ms
memory: 3852kb

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: 824ms
memory: 3560kb

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: 672ms
memory: 3624kb

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: 640ms
memory: 3508kb

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: 1087ms
memory: 3564kb

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: 852ms
memory: 3560kb

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: 981ms
memory: 3564kb

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: 1219ms
memory: 3852kb

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: 2453ms
memory: 3600kb

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: 2716ms
memory: 3620kb

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: 1764ms
memory: 3820kb

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: 1931ms
memory: 3600kb

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: 2916ms
memory: 3564kb

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: 2586ms
memory: 3788kb

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: 1587ms
memory: 3508kb

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: 864ms
memory: 3560kb

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 繁體中文 简体中文

Server Time: 2025-01-20 12:02:48 | OpenSource Project