QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#111037#6560. Broken Minimum Spanning TreeTobo#WA 6ms3652kbC++202.1kb2023-06-05 16:44:582023-06-05 16:45:02

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-05 16:45:02]
  • 评测
  • 测评结果:WA
  • 用时:6ms
  • 内存:3652kb
  • [2023-06-05 16:44:58]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 3005

int n, m, fa[N], dep[N], rem[N], val[N], tr[N], id[N];
array<int, 4> e[N];
vector<array<int, 3>> adj[N];
void dfs(int cur, int f)
{
    dep[cur] = dep[f] + 1;
    fa[cur] = f;
    for (auto [i, x, d] : adj[cur])
    {
        if (i == f)
            continue;
        val[i] = x;
        id[i] = d;
        dfs(i, cur);
    }
}
int solve(int u, int v, int x)
{
    pair<int, int> s = {-1, -1};
    while (u != v)
    {
        if (dep[u] < dep[v])
            swap(u, v);
        if (s.second == -1 && val[u] > x)
            s = {id[u], val[u]};
        else if (val[u] > x && s.second > val[u])
            s = {id[u], val[u]};
        u = fa[u];
    }
    return s.first;
}
void solve()
{
    cin >> n >> m;
    vector<pair<int, int>> ans;
    for (int i = 1; i <= m; i++)
    {
        cin >> e[i][0] >> e[i][1] >> e[i][2];
        e[i][3] = i;
        if (i < n)
        {
            adj[e[i][0]].push_back({e[i][1], e[i][2], i});
            adj[e[i][1]].push_back({e[i][0], e[i][2], i});
            tr[i] = 1;
        }
    }
    dfs(1, 0);
    sort(e + n, e + m + 1, [&](auto &e1, auto &e2)
         { return e1[2] < e2[2]; });
    for (int i = n; i <= m; i++)
    {
        int s = solve(e[i][0], e[i][1], e[i][2]);
        if (s == -1)
            continue;
        tr[s] = 0, rem[s] = 1;
        ans.push_back({s, e[i][3]});
        tr[i] = 1;
        for (int i = 1; i <= n; i++)
            adj[i].clear();
        for (int j = i; j >= 1; j--)
        {
            if (!tr[j])
                continue;
            adj[e[j][0]].push_back({e[j][1], e[j][2], e[j][3]});
            adj[e[j][1]].push_back({e[j][0], e[j][2], e[j][3]});
        }
        dfs(1, 0);
    }
    cout << ans.size() << '\n';
    for (auto [l, r] : ans)
        cout << l << ' ' << r << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3496kb

input:

4 4
1 2 10
2 3 3
3 4 1
1 4 4

output:

1
1 4

result:

ok correct!

Test #2:

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

input:

6 8
1 2 10
2 3 10
3 4 10
4 5 10
5 6 10
6 1 10
1 3 1
4 6 1

output:

2
2 7
5 8

result:

ok correct!

Test #3:

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

input:

2000 1999
1262 1505 968661582
323 1681 787089412
1132 129 88786681
1909 587 762050278
979 1371 230688681
1686 521 980519364
975 191 887826021
869 461 899130441
1433 259 961154249
1718 547 721696188
1254 1042 458319755
1779 267 85751052
1170 813 283230029
309 20 971682908
224 417 255325364
1084 986 7...

output:

0

result:

ok correct!

Test #4:

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

input:

1999 1998
1757 1820 444157563
1757 395 754598547
1757 1571 432619009
1757 1009 456234067
1757 824 935569725
1757 1698 476714469
1757 1420 901765343
1757 1175 225295107
1757 1512 721959801
1757 1585 955067704
1757 1739 635181418
1757 1686 891225461
1757 84 132683224
1757 1696 48915557
1757 1623 42602...

output:

0

result:

ok correct!

Test #5:

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

input:

1999 1998
1345 647 232183406
40 837 279910457
819 857 137486924
255 1378 517489941
827 1565 894953662
1556 1545 898170464
965 877 72248541
1631 298 635713424
895 197 366305735
966 1160 515776809
1870 1638 220711661
1736 220 716014108
1914 1609 759121968
1293 153 272816132
1936 1433 263859075
985 460...

output:

0

result:

ok correct!

Test #6:

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

input:

500 998
105 1 1
105 2 1
105 3 1
105 4 1
105 5 1
105 6 1
105 7 1
105 8 1
105 9 1
105 10 1
105 11 1
105 12 1
105 13 1
105 14 1
105 15 1
105 16 1
105 17 1
105 18 1
105 19 1
105 20 1
105 21 1
105 22 1
105 23 1
105 24 1
105 25 1
105 26 1
105 27 1
105 28 1
105 29 1
105 30 1
105 31 1
105 32 1
105 33 1
105 ...

output:

0

result:

ok correct!

Test #7:

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

input:

500 998
364 1 1
364 2 1
364 3 1
364 4 1
364 5 1
364 6 1
364 7 1
364 8 1
364 9 1
364 10 1
364 11 1
364 12 1
364 13 1
364 14 1
364 15 1
364 16 1
364 17 1
364 18 1
364 19 1
364 20 1
364 21 1
364 22 1
364 23 1
364 24 1
364 25 1
364 26 1
364 27 1
364 28 1
364 29 1
364 30 1
364 31 1
364 32 1
364 33 1
364 ...

output:

0

result:

ok correct!

Test #8:

score: 0
Accepted
time: 5ms
memory: 3528kb

input:

500 998
86 1 2
86 2 2
86 3 2
86 4 2
86 5 2
86 6 2
86 7 2
86 8 2
86 9 2
86 10 2
86 11 2
86 12 2
86 13 2
86 14 2
86 15 2
86 16 2
86 17 2
86 18 2
86 19 2
86 20 2
86 21 2
86 22 2
86 23 2
86 24 2
86 25 2
86 26 2
86 27 2
86 28 2
86 29 2
86 30 2
86 31 2
86 32 2
86 33 2
86 34 2
86 35 2
86 36 2
86 37 2
86 38...

output:

499
496 827
327 842
342 841
341 840
340 839
339 838
338 837
337 836
336 835
335 834
334 833
333 832
332 831
331 830
330 829
329 828
328 843
343 826
326 825
325 824
324 823
323 822
322 821
321 820
320 819
319 818
318 817
317 816
316 815
315 814
314 813
313 812
312 858
358 873
373 872
372 871
371 870
...

result:

ok correct!

Test #9:

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

input:

500 998
198 227 1
227 315 1
315 426 1
426 400 1
400 61 1
61 143 1
143 487 1
487 65 1
65 415 1
415 434 1
434 327 1
327 190 1
190 411 1
411 51 1
51 91 1
91 364 1
364 185 1
185 393 1
393 89 1
89 53 1
53 66 1
66 69 1
69 13 1
13 5 1
5 45 1
45 314 1
314 291 1
291 490 1
490 92 1
92 175 1
175 458 1
458 218 ...

output:

0

result:

ok correct!

Test #10:

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

input:

500 998
360 250 1
250 71 1
71 170 1
170 492 1
492 419 1
419 145 1
145 188 1
188 433 1
433 186 1
186 161 1
161 398 1
398 19 1
19 479 1
479 401 1
401 40 1
40 176 1
176 212 1
212 353 1
353 290 1
290 43 1
43 322 1
322 447 1
447 47 1
47 468 1
468 456 1
456 343 1
343 339 1
339 52 1
52 251 1
251 130 1
130 ...

output:

0

result:

ok correct!

Test #11:

score: 0
Accepted
time: 6ms
memory: 3484kb

input:

500 998
369 45 2
45 364 2
364 300 2
300 195 2
195 291 2
291 390 2
390 122 2
122 331 2
331 408 2
408 91 2
91 298 2
298 116 2
116 301 2
301 287 2
287 338 2
338 4 2
4 79 2
79 177 2
177 387 2
387 125 2
125 477 2
477 11 2
11 284 2
284 102 2
102 305 2
305 395 2
395 112 2
112 280 2
280 294 2
294 232 2
232 ...

output:

499
481 827
155 842
79 841
178 840
444 839
238 838
156 837
305 836
239 835
69 834
364 833
356 832
327 831
301 830
23 829
1 828
262 843
210 826
420 825
77 824
85 823
153 822
440 821
46 820
189 819
488 818
465 817
489 816
408 815
382 814
282 813
344 812
193 858
246 873
303 872
143 871
349 870
136 869
...

result:

ok correct!

Test #12:

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

input:

500 998
298 314 1
467 314 1
9 314 1
345 298 1
497 298 1
315 467 1
147 345 1
154 345 1
16 345 1
226 497 1
406 147 1
204 298 1
351 406 1
432 314 1
274 406 1
340 274 1
395 226 1
173 315 1
180 274 1
207 9 1
495 204 1
213 298 1
413 207 1
450 204 1
25 147 1
161 497 1
231 180 1
175 467 1
199 231 1
454 231 ...

output:

0

result:

ok correct!

Test #13:

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

input:

500 998
42 349 1
256 42 1
202 349 1
23 42 1
252 42 1
175 42 1
67 252 1
302 67 1
337 252 1
495 252 1
14 349 1
347 202 1
494 495 1
206 347 1
1 302 1
434 349 1
475 206 1
243 206 1
135 494 1
179 495 1
226 202 1
490 226 1
481 1 1
165 243 1
114 495 1
463 256 1
282 114 1
411 202 1
25 1 1
163 67 1
388 179 1...

output:

0

result:

ok correct!

Test #14:

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

input:

500 998
493 328 2
444 493 2
356 328 2
374 328 2
135 328 2
292 444 2
323 135 2
296 328 2
407 493 2
207 374 2
118 296 2
490 135 2
357 323 2
464 292 2
279 323 2
183 493 2
81 356 2
367 407 2
235 356 2
354 292 2
479 464 2
214 118 2
406 357 2
164 279 2
230 356 2
380 164 2
399 135 2
344 81 2
190 490 2
422 ...

output:

499
328 827
40 842
298 841
118 840
340 839
230 838
338 837
337 836
301 835
335 834
334 833
333 832
332 831
331 830
206 829
329 828
344 843
284 826
326 825
325 824
324 823
266 822
30 821
321 820
320 819
307 818
318 817
317 816
316 815
315 814
314 813
313 812
359 858
374 873
17 872
372 871
371 870
370...

result:

ok correct!

Test #15:

score: -100
Wrong Answer
time: 2ms
memory: 3420kb

input:

10 20
3 5 132699872
7 3 667475629
10 7 829222331
1 7 265644695
4 3 226461311
2 7 720348681
6 10 703702759
8 4 153004599
9 10 646988804
1 9 45480111
2 4 784301144
1 9 628023542
7 8 449200681
9 2 240371799
3 2 420603433
3 9 838425734
4 6 623790050
1 7 513829155
1 9 883183260
10 3 422484921

output:

6
4 10
9 14
2 15
6 20
3 13
7 17

result:

FAIL participant's MST is better than jury!