QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#110953 | #6560. Broken Minimum Spanning Tree | USP_USP_USP# | WA | 76ms | 3592kb | C++20 | 1.7kb | 2023-06-05 00:08:50 | 2023-06-05 00:08:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back
void dbg_out() { cerr << endl; }
template<typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
struct edge{
int u,v,w;
int id;
bool operator<(const edge &e) const{
return w < e.w;
}
};
void solve() {
int n,m;
cin >> n >> m;
vector<int> esta(m);
for(int i = 0; i < n-1; i++){
esta[i] = 1;
}
vector<edge> e(m);
for(int i = 0; i < m; i++){
cin >> e[i].u >> e[i].v >> e[i].w;
e[i].u--;
e[i].v--;
e[i].id = i;
}
sort(e.begin(), e.end());
vector<pair<int,int>> ans;
for(int k = 0; k < m; k++){
if(!esta[e[k].id]) continue;
vector<int> uf(n);
vector<int> sz(n);
for(int i = 0; i < n; i++){
uf[i] = i;
sz[i] = 1;
}
function<int(int)> find = [&](int x){
return x == uf[x] ? x : uf[x]=find(uf[x]);
};
auto uni = [&](int a, int b){
a = find(a);
b = find(b);
if(a == b) return 0;
if(sz[a] > sz[b]) swap(a,b);
sz[b] += sz[a];
uf[a] = b;
return 1;
};
for(int i = 0; i < m; i++){
if(esta[e[i].id] && i != k) uni(e[i].u, e[i].v);
}
for(int i = 0; i < k; i++){
if(esta[e[i].id]) continue;
if(e[i].w == e[k].w) continue;
int ret = uni(e[i].u, e[i].v);
if(ret){
ans.pb( {e[i].id, e[k].id});
esta[e[i].id] = 1;
esta[e[k].id] = 0;
break;
}
}
}
cout << ans.size() << '\n';
for(auto [a,b] : ans){
cout << b+1 << ' ' << a+1 << '\n';
}
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int t = 1;
while(t--)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3420kb
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: 3408kb
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 1 7 4 8
result:
ok correct!
Test #3:
score: 0
Accepted
time: 76ms
memory: 3524kb
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: 48ms
memory: 3584kb
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: 62ms
memory: 3536kb
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: 5ms
memory: 3468kb
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: 5ms
memory: 3468kb
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: 8ms
memory: 3592kb
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 173 673 158 658 159 659 160 660 161 661 162 662 163 663 164 664 165 665 166 666 167 667 168 668 169 669 170 670 171 671 172 672 157 657 174 674 175 675 176 676 177 677 178 678 179 679 180 680 181 681 182 682 183 683 184 684 185 685 186 686 187 687 188 688 142 642 127 627 128 628 129 629 130 630 ...
result:
ok correct!
Test #9:
score: 0
Accepted
time: 2ms
memory: 3432kb
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: 5ms
memory: 3464kb
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: 8ms
memory: 3576kb
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 173 658 158 659 159 680 160 856 161 586 162 555 163 950 164 606 165 676 166 851 167 754 168 646 169 544 170 982 171 865 172 506 157 887 174 722 175 764 176 854 177 806 178 511 179 839 180 508 181 944 182 501 183 685 184 921 185 677 186 762 187 559 188 927 142 686 127 661 128 770 129 567 130 868 ...
result:
ok correct!
Test #12:
score: 0
Accepted
time: 6ms
memory: 3464kb
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: 5ms
memory: 3468kb
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: 3568kb
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 173 672 158 657 159 658 160 659 161 660 162 661 163 662 164 663 165 664 166 665 167 666 168 667 169 668 170 669 171 670 172 671 157 656 174 673 175 674 176 675 177 676 178 677 179 678 180 679 181 680 182 681 183 682 184 683 185 684 186 685 187 686 188 687 142 641 127 626 128 627 129 628 130 629 ...
result:
ok correct!
Test #15:
score: -100
Wrong Answer
time: 0ms
memory: 3488kb
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 7 17 6 4 3 20
result:
FAIL participant's plan is better than jury!