# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924213 | 2024-02-08T16:31:11 Z | dwuy | Cheap flights (LMIO18_pigus_skrydziai) | C++14 | 3 ms | 9308 KB |
#include <bits/stdc++.h> #define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL) #define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout) #define fi first #define se second #define endl "\n" #define len(s) int32_t(s.length()) #define MASK(k)(1LL<<(k)) #define TASK "test" using namespace std; typedef tuple<int, int, int> tpiii; typedef pair<double, double> pdd; typedef pair<int, int> pii; typedef long long ll; const long long OO = 1e18; const int MOD = 1e9 + 7; const int INF = 1e9; const int MX = 300005; int n, m; int sum[MX]; vector<pii> G[MX]; tpiii edges[MX<<1]; bitset<MX> ok = 0; int cost[MX]; void nhap(){ cin >> n >> m; for(int i=1; i<=m; i++){ int u, v, c; cin >> u >> v >> c; G[u].push_back({v, c}); G[v].push_back({u, c}); edges[i] = {c, u, v}; sum[u] += c; sum[v] += c; } } void solve(){ int ans = 0; for(int i=1; i<=n; i++) ans = max(ans, sum[i]); sort(edges+1, edges+1+m); for(int i=1; i<=min(m, max(1000, m>>1)); i++){ int c, u, v; tie(c, u, v) = edges[i]; for(pii &tmp: G[u]){ int f, k; tie(f, k) = tmp; ok[f] = 1; cost[f] = k; } for(pii &tmp: G[v]){ int f, k; tie(f, k) = tmp; if(ok[f]) ans = max(ans, c + k + cost[f]); } for(pii &tmp: G[u]){ int f, k; tie(f, k) = tmp; ok[f] = cost[f] = 0; } } cout << ans; } int32_t main(){ fastIO; file(TASK); nhap(); solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 9308 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 9308 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 9304 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 9304 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |