QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#409114#7680. Subwaylight_ink_dots#WA 1ms3872kbC++141.0kb2024-05-11 19:05:312024-05-11 19:05:32

Judging History

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

  • [2024-05-11 19:05:32]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3872kb
  • [2024-05-11 19:05:31]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

int main() {
    static const int maxn = 60, B = 10000;
    int n, mx = 0;
    scanf("%d", &n);
    struct point {
        int x, y, a;
    };
    static point p[maxn];
    for (int i = 1; i <= n; i++) scanf("%d %d %d", &p[i].x, &p[i].y, &p[i].a), mx = max(mx, p[i].a);
    sort(p + 1, p + n + 1,
         [](const point x, const point y) { return x.x + 2 * B * x.y < y.x + 2 * B * y.y; });
    printf("%d\n", mx);
    for (int l = 1; l <= mx; l++) {
        int dx = (1 - 2 * (B + l)) * B - 1000, dy = B + l;
        vector<pair<int, int>> ans;
        for (int i = 1; i <= n; i++)
            if (p[i].a < l)
                p[i].x -= 2 * B, p[i].y++;
        for (int i = 1; i <= n; i++) {
            ans.emplace_back(p[i].x, p[i].y);
            ans.emplace_back(p[i].x + dx, p[i].y + dy);
        }
        printf("%d", (int)ans.size());
        for (auto p : ans) printf(" %d %d", p.first, p.second);
        printf("\n");
    }
    return 0;
}

详细

Test #1:

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

input:

3
1 2 1
2 1 2
3 3 2

output:

2
6 2 1 -200010998 10002 1 2 -200010999 10003 3 3 -200010997 10004
6 2 1 -200030998 10003 -19999 3 -200050999 10005 3 3 -200030997 10005

result:

ok ok Sum L = 12

Test #2:

score: 0
Accepted
time: 0ms
memory: 3824kb

input:

1
1 1 1

output:

1
2 1 1 -200010999 10002

result:

ok ok Sum L = 2

Test #3:

score: 0
Accepted
time: 0ms
memory: 3872kb

input:

1
1 1 50

output:

50
2 1 1 -200010999 10002
2 1 1 -200030999 10003
2 1 1 -200050999 10004
2 1 1 -200070999 10005
2 1 1 -200090999 10006
2 1 1 -200110999 10007
2 1 1 -200130999 10008
2 1 1 -200150999 10009
2 1 1 -200170999 10010
2 1 1 -200190999 10011
2 1 1 -200210999 10012
2 1 1 -200230999 10013
2 1 1 -200250999 1001...

result:

ok ok Sum L = 100

Test #4:

score: -100
Wrong Answer
time: 1ms
memory: 3792kb

input:

50
662 -567 48
728 -120 7
307 669 27
-885 -775 21
100 242 9
-784 -537 41
940 198 46
736 -551 30
-449 456 16
-945 382 18
-182 810 49
213 187 44
853 245 48
617 -305 19
-81 261 3
617 208 8
-548 -652 6
-888 -667 14
-371 -812 43
202 -702 10
-668 -725 5
961 -919 33
-870 -697 50
428 810 29
560 405 7
348 -3...

output:

50
100 961 -919 -200010039 9082 -306 -897 -200011306 9104 334 -893 -200010666 9108 -371 -812 -200011371 9189 -885 -775 -200011885 9226 -668 -725 -200011668 9276 -462 -719 -200011462 9282 202 -702 -200010798 9299 -870 -697 -200011870 9304 -888 -667 -200011888 9334 -548 -652 -200011548 9349 662 -567 -...

result:

wrong answer Polyline 2 intersects with previous polylines.