QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#385444 | #8136. Rebellious Edge | ucup-team3215# | WA | 44ms | 3572kb | C++20 | 1.6kb | 2024-04-10 19:19:29 | 2024-04-10 19:19:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = array<int, 2>;
using e = array<int, 3>;
using graph = vector< vector<e> >;
#define all(x) (x).begin(), (x).end()
void solve() {
int n, m;
cin >> n >> m;
e spec;
graph gt(n);
for (int i = 0; i < m; ++i) {
int u, v, w;
cin >> u >> v >> w;
--u;--v;
if (u > v) {
spec = {w, u, v};
} else {
gt[v].push_back({w, v, u});
}
}
ll tmp = 0;
vector<int> prev(n, -1), mn(n, 0);
for (int i = n - 1; i > 0; --i) {
sort(all(gt[i]));
e cur = gt[i][0];
tmp += cur[0];
mn[i] = cur[0];
prev[i] = cur[2];
}
ll ans = tmp;
int to = spec[1];
set<int> in_cycle;
while (to != spec[2] && prev[to] != -1) {
in_cycle.insert(to);
to = prev[to];
}
in_cycle.insert(to);
if (to == spec[2]) {
auto [sw, su, sv] = spec;
tmp += sw;
tmp -= mn[sv];
while (su != sv) {
for (auto [w, _, vv] : gt[su]) {
if (in_cycle.count(vv)) {
continue;
}
ll tmp2 = tmp;
tmp2 -= mn[su];
tmp2 += w;
ans = min(ans, tmp2);
}
su = prev[su];
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3504kb
input:
3 5 6 1 2 4 1 3 2 2 3 0 3 4 1 4 5 1 5 2 1 4 4 1 2 4 1 3 6 1 4 8 4 2 1000000 3 3 1 2 100 2 1 10 2 3 1000
output:
5 18 1100
result:
ok 3 number(s): "5 18 1100"
Test #2:
score: -100
Wrong Answer
time: 44ms
memory: 3572kb
input:
50000 4 5 2 4 998973548 2 3 501271695 4 1 778395982 1 4 32454891 1 2 757288934 4 5 1 4 720856669 2 3 665098951 3 4 407461517 2 1 866914401 1 2 457859826 4 5 1 2 75288664 1 4 624893594 3 2 458973866 2 4 769074655 2 3 834773751 4 5 2 3 237060634 2 4 297307882 3 4 200383586 1 2 42856502 3 1 16574713 4 ...
output:
1291015520 1530420294 1534956009 480300722 1366795927 1541095843 2493849488 858095911 1039553235 793861088 635606317 1051598350 612891589 1265994009 622081756 1678219738 1556463491 93634961 960978736 984886788 1696503797 1258199648 1969660290 1431417780 1515267731 977157479 1937478556 654475526 1401...
result:
wrong answer 9th numbers differ - expected: '1034153425', found: '1039553235'