QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#659961#9412. Stop the Castleretired_midlightsAC ✓8ms9960kbC++144.6kb2024-10-20 00:13:172024-10-20 00:13:18

Judging History

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

  • [2024-10-20 00:13:18]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:9960kb
  • [2024-10-20 00:13:17]
  • 提交

answer

#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;
const int N = 100010, INF = 1e9;
struct Info {
    int x, l, r;
} rows[N], cols[N];
namespace net {
    struct Edge {
        int v, c, f, nxt;
    } e[N];
    int hd[N], cur[N], n, ec, d[N], s, t;
    void clr(int sz, int ss, int tt) {
        s = ss, t = tt, n = sz;
        fill(hd, hd + n + 1, -1);
        ec = 0;
    }
    void add(int u, int v, int c) {
        // cerr << u << " " << v << " " << c << '\n';
        e[ec] = {v, c, 0, hd[u]}, hd[u] = ec ++;
        e[ec] = {u, 0, 0, hd[v]}, hd[v] = ec ++;
    }
    bool bfs() {
        fill(d, d + n + 1, -1);
        queue < int > q; q.push(t), d[t] = INF;
        while(q.size()) {
            int u = q.front(); q.pop();
            for(int i = hd[u]; i != -1; i = e[i].nxt) {
                int v = e[i].v;
                if(e[i ^ 1].f < e[i ^ 1].c && !~d[v]) {
                    d[v] = d[u] - 1;
                    q.push(v);
                    if(v == s) return ~d[s];
                }
            }
        }
        return ~d[s];
    }
    int dfs(int u, int a) {
        if(u == t || a == 0) return a;
        int ans = 0, f;
        for(int & i = cur[u]; ~i; i = e[i].nxt) {
            Edge & p = e[i];
            if(d[p.v] == d[u] + 1 && (f = dfs(p.v, min(a, p.c - p.f))) > 0) {
                e[i].f += f;
                e[i ^ 1].f -= f;
                ans += f;
                if(!(a -= f)) break;
            }
        }
        return ans;
    }
    int dinic() {
        int res = 0;
        while(bfs()) {
            copy(hd, hd + n + 1, cur);
            res += dfs(s, INF);
        }
        return res;
    }
    void print(int cntx, int cnty) {
        rep(i, 1, cntx) {
            for(int j = hd[i]; j != -1; j = e[j].nxt) {
                int v = e[j].v;
                if(v != s && e[j].f == 1) {
                    // cerr << i << " " << v << " " << e[j].c << '\n';
                    cout << rows[i].x << " " << cols[v - cntx].x << '\n';
                }
            }
        }
        rep(i, 1, cntx) {
            for(int j = hd[i]; j != -1; j = e[j].nxt) {
                if(e[j].v == s && e[j].f == 0) {
                    // cerr << i << " " << e[j].v << " " << e[j].c << '\n';
                    cout << rows[i].x << " " << rows[i].l << '\n';
                }
            }
        }
        rep(i, cntx + 1, cntx + cnty) {
            for(int j = hd[i]; j != -1; j = e[j].nxt) {
                if(e[j].v == t && e[j].f == 0) {
                    // cerr << i << " " << t << " " << e[j].c << '\n';
                    cout << cols[i - cntx].l << " " << cols[i - cntx].x << '\n';
                }
            }
        }
    }
}
int n, m, r[N], c[N], a[N], b[N];
void solve() {
    cin >> n;
    rep(i, 1, n) cin >> r[i] >> c[i];
    cin >> m;
    rep(i, 1, m) cin >> a[i] >> b[i];
    int cntx = 0, cnty = 0;
    rep(i, 1, n) rep(j, 1, n) if(r[i] == r[j] && c[i] < c[j]) {
        if(c[i] + 1 == c[j]) {
            cout << "-1\n";
            return;
        }
        bool flag = 0;
        rep(k, 1, n) if(r[i] == r[k] && c[i] < c[k] && c[k] < c[j]) flag = 1;
        rep(k, 1, m) if(r[i] == a[k] && c[i] < b[k] && b[k] < c[j]) flag = 1;
        if(!flag) {
            rows[++ cntx] = Info{r[i], c[i] + 1, c[j] - 1};
        }
    }
    rep(i, 1, n) rep(j, 1, n) if(c[i] == c[j] && r[i] < r[j]) {
        if(r[i] + 1 == r[j]) {
            cout << "-1\n";
            return;
        }
        bool flag = 0;
        rep(k, 1, n) if(c[i] == c[k] && r[i] < r[k] && r[k] < r[j]) flag = 1;
        rep(k, 1, m) if(c[i] == b[k] && r[i] < a[k] && a[k] < r[j]) flag = 1;
        if(!flag) {
            cols[++ cnty] = Info{c[i], r[i] + 1, r[j] - 1};
        }
    }
    int s = 0, t = cntx + cnty + 1;
    net :: clr(cntx + cnty + 1, s, t);
    rep(i, 1, cntx) net :: add(s, i, 1);
    rep(i, 1, cnty) net :: add(i + cntx, t, 1);
    rep(i, 1, cntx) rep(j, 1, cnty) {
        if(cols[j].l <= rows[i].x && rows[i].x <= cols[j].r && rows[i].l <= cols[j].x && cols[j].x <= rows[i].r)
            net :: add(i, j + cntx, 1);
    }
    int res = net :: dinic();
    cout << cntx + cnty - res << '\n';
    net :: print(cntx, cnty);
}
int main() {
#ifdef LOCAL
    freopen("data.in", "r", stdin);
#endif
    ios :: sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    cin >> T;
    while(T --) solve();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

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

input:

4
7
1 3
6 6
4 7
2 1
6 3
4 1
2 6
3
3 4
6 4
3 1
2
1 1
2 2
0
3
1 1
1 3
3 3
1
1 2
3
1 1
1 3
2 3
0

output:

2
2 3
4 6
0
1
2 3
-1

result:

ok ok 4 cases (4 test cases)

Test #2:

score: 0
Accepted
time: 1ms
memory: 9684kb

input:

21
11
3 5
18 6
19 12
27 48
28 38
30 12
33 18
42 18
43 38
45 46
48 34
3
2 6
24 4
41 45
15
11 6
15 27
16 9
16 14
16 48
19 26
25 12
27 26
28 4
31 40
32 6
33 50
37 50
46 11
50 29
17
1 49
4 9
9 15
9 22
11 31
11 46
14 28
17 5
17 49
18 43
20 31
30 46
33 11
33 33
34 15
36 6
47 10
2
16 46
36 30
11
7 34
7 41
...

output:

3
20 12
29 38
34 18
5
16 10
16 15
12 6
20 26
34 50
0
1
16 10
0
1
43 22
5
1 3
1 13
33 10
44 45
42 44
0
5
27 41
29 26
44 4
8 1
21 15
1
32 9
0
0
0
0
6
23 10
35 34
12 11
23 44
29 21
24 46
0
3
20 30
43 25
31 17
0
-1
3
16 36
25 7
17 39
6
7 5
8 11
5 5
6 4
4 9
3 10

result:

ok ok 21 cases (21 test cases)

Test #3:

score: 0
Accepted
time: 1ms
memory: 7712kb

input:

2
200
7 52
9 160
10 4
12 61
18 436
19 430
20 499
24 139
25 416
29 53
33 153
35 275
35 310
37 25
38 477
39 349
42 120
44 158
45 330
49 486
50 204
51 67
52 138
52 305
56 139
63 132
66 4
67 327
70 484
71 67
72 308
74 218
76 479
81 139
82 90
86 201
87 335
91 35
91 220
92 496
94 29
94 436
96 359
97 299
1...

output:

46
52 139
91 160
94 61
126 153
132 67
154 138
154 496
185 35
187 467
199 432
224 147
260 275
270 305
277 356
306 374
311 177
334 367
349 112
352 61
393 307
35 276
126 214
187 433
224 393
261 468
274 67
277 189
311 455
390 308
440 179
453 251
11 4
19 436
21 499
38 25
39 477
52 67
57 139
138 429
240 3...

result:

ok ok 2 cases (2 test cases)

Test #4:

score: 0
Accepted
time: 1ms
memory: 7712kb

input:

20
13
89287395 441913071
89287395 590314987
142917372 582720391
142917372 598813561
232930851 582720391
263974835 468188689
263974835 490702144
543529670 152471388
543529670 219371706
647691663 598813561
772865038 598813561
773363571 482933265
773363571 561453301
8
128947560 120560639
264980960 4742...

output:

8
89287395 441913072
142917372 582720392
263974835 468188690
543529670 152471389
773363571 482933266
142917373 582720391
142917373 598813561
647691664 598813561
7
808969359 818037531
808969359 386523246
808969359 891229782
59832704 871951216
92745430 358274214
469117951 762966373
808969360 354711322...

result:

ok ok 20 cases (20 test cases)

Test #5:

score: 0
Accepted
time: 2ms
memory: 9680kb

input:

2
184
35763790 435860426
152681166 443483111
261932524 745277126
261932524 787982418
314305867 342102981
314305867 522593781
314305867 747023891
314305867 811404535
314305867 816914009
314305867 857896659
319901983 797458033
321347896 342102981
332550928 902179526
343207116 914408792
350635050 15515...

output:

160
314305867 787982418
350635050 435860426
350635050 797458033
407380694 342102981
469496529 342102981
469496529 438907614
469496529 732085440
469496529 816914009
469496529 837963933
495537855 461654555
496813081 699021890
496813081 787982418
496813081 815487777
496813081 857896659
520115644 751818...

result:

ok ok 2 cases (2 test cases)

Test #6:

score: 0
Accepted
time: 2ms
memory: 9960kb

input:

2
193
78368109 329329995
87932514 657474465
87932514 903492853
94608574 845872655
103602204 88649154
124431127 405860533
145262472 108198774
145262472 907127202
154400439 136367504
165270984 773451933
184157521 409828915
197728547 291882089
197728547 609623645
211750768 843867422
246178069 108396139...

output:

145
145262472 845872655
197728547 405860533
246178069 843867422
291242118 564718673
365329221 136367504
365329221 211655411
365329221 409828915
365329221 657489855
365329221 773451933
365329221 845363118
382558552 984789430
385064292 502303728
391226954 779506686
410833945 564718673
412106895 135814...

result:

ok ok 2 cases (2 test cases)

Test #7:

score: 0
Accepted
time: 2ms
memory: 7920kb

input:

2
192
1075648 579875717
1075648 937648715
1393060 191616432
3957616 541362608
3957616 971879257
5415801 541362608
5887448 541362608
5887448 624842533
25767120 610618164
26193206 214214028
26193206 231445627
26727662 374314271
29550509 755417826
29550509 917592925
30033126 610618164
31134588 58188305...

output:

131
31134588 231445627
33207011 755417826
46425938 934726175
250896470 288390629
295641139 541362608
333807226 762642201
340743563 264208611
341366249 231445627
360971009 755417826
417168695 231445627
417966308 381919591
418600362 755417826
429088204 541362608
509798823 541362608
509798823 624842533...

result:

ok ok 2 cases (2 test cases)

Test #8:

score: 0
Accepted
time: 1ms
memory: 7924kb

input:

20
14
378192988 147499872
378192988 837331700
449924898 147499872
449924898 837331700
592684636 147499872
592684636 837331700
783332532 147499872
783332532 837331700
378192988 197547597
783332532 197547597
378192988 343857831
783332532 343857831
378192988 576579017
783332532 576579017
2
449924898 19...

output:

15
378192988 147499873
783332532 147499873
378192988 197547598
783332532 197547598
378192988 343857832
783332532 343857832
378192988 576579018
783332532 576579018
378192989 147499872
378192989 837331700
449924899 147499872
449924899 837331700
592684637 147499872
592684637 837331700
378192989 5765790...

result:

ok ok 20 cases (20 test cases)

Test #9:

score: 0
Accepted
time: 3ms
memory: 7656kb

input:

2
200
8623893 3649468
8623893 989134714
24820918 3649468
24820918 989134714
43705451 3649468
43705451 989134714
45500146 3649468
45500146 989134714
58265855 3649468
58265855 989134714
112263159 3649468
112263159 989134714
126496650 3649468
126496650 989134714
137574156 3649468
137574156 989134714
14...

output:

249
24820918 6255307
43705451 11610914
45500146 23366504
58265855 28938721
112263159 31914492
126496650 36029445
137574156 66226935
140089445 84152868
156036789 132710904
170794245 149083019
176576709 174305881
186774359 180413073
194114590 195080121
222368048 231772824
237249112 234663336
250839457...

result:

ok ok 2 cases (2 test cases)

Test #10:

score: 0
Accepted
time: 3ms
memory: 7640kb

input:

2
200
2691939 27674656
2691939 984614319
30225807 27674656
30225807 984614319
39388076 27674656
39388076 984614319
55883389 27674656
55883389 984614319
77258752 27674656
77258752 984614319
106874917 27674656
106874917 984614319
144383292 27674656
144383292 984614319
145360776 27674656
145360776 9846...

output:

216
279200011 293316179
347252805 363531956
446662965 376231503
496057717 383623456
514655989 390555088
523731402 441004197
538628510 490065400
562810007 540189713
630132600 545422987
631858791 565468975
643299496 646360861
754008138 861149655
782710197 901945895
2691939 27674657
997421612 27674657
...

result:

ok ok 2 cases (2 test cases)

Test #11:

score: 0
Accepted
time: 8ms
memory: 7952kb

input:

2
200
1005937 7
3412691 7
5764908 7
7897785 7
8061992 7
12801501 7
18529696 7
22574605 7
25203351 7
34574958 7
34998216 7
40928451 7
49792193 7
55962320 7
59632864 7
62353373 7
62611196 7
65346591 7
71459320 7
71550121 7
72215989 7
82584263 7
86119549 7
96204862 7
96940713 7
97693112 7
102067050 7
1...

output:

199
1005938 7
3412692 7
5764909 7
7897786 7
8061993 7
12801502 7
18529697 7
22574606 7
25203352 7
34574959 7
34998217 7
40928452 7
49792194 7
55962321 7
59632865 7
62353374 7
62611197 7
65346592 7
71459321 7
71550122 7
72215990 7
82584264 7
86119550 7
96204863 7
96940714 7
97693113 7
102067051 7
105...

result:

ok ok 2 cases (2 test cases)

Extra Test:

score: 0
Extra Test Passed