# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
696916 | 2023-02-07T15:45:26 Z | Do_you_copy | Parkovi (COCI22_parkovi) | C++17 | 708 ms | 46984 KB |
//Then #include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define faster ios_base::sync_with_stdio(0); cin.tie(0); #define int long long using namespace std; using ll = long long; using ld = long double; using pii = pair <int, int>; mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 3e5 + 1; //const int Mod = 1e9 + 7; //const int inf = int n, k; vector <pii> adj[maxN]; ll mid, cnt; ll dp[maxN]; set <int> S; void dfs(int u, int p){ dp[u] = 0; for (auto i: adj[u]){ if (i.fi == p) continue; dfs(i.fi, u); if (dp[i.fi] + i.se > mid){ ++cnt; S.insert(i.fi); } else dp[u] = max(dp[u], dp[i.fi] + i.se); } } bool check(){ S.clear(); cnt = 0; dfs(1, 0); return cnt <= k; } void Init(){ cin >> n >> k; for (int i = 1; i < n; ++i){ int u, v, w; cin >> u >> v >> w; adj[u].pb({v, w}); adj[v].pb({u, w}); } ll l = 0, r = 1e4; while (l < r){ mid = (l + r) >> 1; if (check()) r = mid; else l = mid + 1; } mid = l; check(); cout << l << "\n"; for (int i = 1; i <= n; ++i){ if (S.size() == k) break; S.insert(i); } for (auto i: S) cout << i << " "; } #define debug #define taskname "test" signed main(){ faster if (fopen(taskname".inp", "r")){ freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } int tt = 1; //cin >> tt; while (tt--){ Init(); } if (fopen("timeout.txt", "r")){ ofstream timeout("timeout.txt"); timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000); timeout.close(); #ifndef debug cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n"; #endif // debug } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 177 ms | 45172 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 708 ms | 46984 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 7252 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |