oj.uz

Submission #537481

# Submission time Handle Problem Language Result Execution time Memory
537481 2022-03-15T07:05:57 Z maomao90 Paths (RMI21_paths) C++17
48 / 100
 600 ms 10232 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

#define INF 1000000005
#define LINF 1000000000000000005ll
#define MAXN 100005

int n, k;
vii adj[MAXN];

multiset<ll> st;
ll mx[MAXN];
void dfs(int u, int p) {
    mx[u] = 0;
    bool leaf = 1;
    for (auto [v, w] : adj[u]) {
        if (v == p) continue;
        leaf = 0;
        dfs(v, u);
        auto it = st.find(mx[v]);
        if (it != st.end()) {
            st.erase(st.find(mx[v]));
        }
        st.insert(mx[v] + w);
        if (st.size() > k) {
            st.erase(st.begin());
        }
        mxto(mx[u], mx[v] + w);
    }
    if (leaf) {
        st.insert(0);
    }
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> k;
    REP (i, 1, n) {
        int a, b, c; cin >> a >> b >> c;
        adj[a].pb(MP(b, c));
        adj[b].pb(MP(a, c));
    }
    if (k == 1) {
        vll dist(n + 1, 0);
        vll ans(n + 1, 0);
        auto dfs = [&] (auto &&self, int u, int p) {
            if (0) return -1;
            int mx = u;
            for (auto [v, w] : adj[u]) {
                if (v == p) continue;
                dist[v] = dist[u] + w;
                int x = self(self, v, u);
                if (dist[mx] < dist[x]) {
                    mx = x;
                }
            }
            return mx;
        };
        dist[1] = 0;
        int a = dfs(dfs, 1, -1);
        dist[a] = 0;
        int b = dfs(dfs, a, -1);
        REP (i, 1, n + 1) {
            mxto(ans[i], dist[i]);
        }
        dist[b] = 0;
        dfs(dfs, b, -1);
        REP (i, 1, n + 1) {
            mxto(ans[i], dist[i]);
        }
        REP (i, 1, n + 1) {
            cout << ans[i] << '\n';
        }
        return 0;
    }
    REP (i, 1, n + 1) {
        st.clear();
        dfs(i, -1);
        ll ans = 0;
        for (ll x : st) {
            ans += x;
        }
        cout << ans << '\n';
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void dfs(int, int)':
Main.cpp:54:23: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |         if (st.size() > k) {
      |             ~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 2644 KB Output is correct
4 Correct 6 ms 2708 KB Output is correct
5 Correct 6 ms 2656 KB Output is correct
6 Correct 5 ms 2656 KB Output is correct
7 Correct 8 ms 2656 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 2644 KB Output is correct
4 Correct 6 ms 2708 KB Output is correct
5 Correct 6 ms 2656 KB Output is correct
6 Correct 5 ms 2656 KB Output is correct
7 Correct 8 ms 2656 KB Output is correct
8 Correct 187 ms 2728 KB Output is correct
9 Correct 102 ms 2904 KB Output is correct
10 Correct 107 ms 2756 KB Output is correct
11 Correct 132 ms 2748 KB Output is correct
12 Correct 137 ms 2776 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 2644 KB Output is correct
4 Correct 6 ms 2708 KB Output is correct
5 Correct 6 ms 2656 KB Output is correct
6 Correct 5 ms 2656 KB Output is correct
7 Correct 8 ms 2656 KB Output is correct
8 Correct 187 ms 2728 KB Output is correct
9 Correct 102 ms 2904 KB Output is correct
10 Correct 107 ms 2756 KB Output is correct
11 Correct 132 ms 2748 KB Output is correct
12 Correct 137 ms 2776 KB Output is correct
13 Execution timed out 843 ms 2912 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 9048 KB Output is correct
2 Correct 84 ms 10232 KB Output is correct
3 Correct 58 ms 8692 KB Output is correct
4 Correct 66 ms 8996 KB Output is correct
5 Correct 71 ms 9860 KB Output is correct
6 Correct 71 ms 8976 KB Output is correct

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 6 ms 2644 KB Output is correct
4 Correct 6 ms 2708 KB Output is correct
5 Correct 6 ms 2656 KB Output is correct
6 Correct 5 ms 2656 KB Output is correct
7 Correct 8 ms 2656 KB Output is correct
8 Correct 187 ms 2728 KB Output is correct
9 Correct 102 ms 2904 KB Output is correct
10 Correct 107 ms 2756 KB Output is correct
11 Correct 132 ms 2748 KB Output is correct
12 Correct 137 ms 2776 KB Output is correct
13 Execution timed out 843 ms 2912 KB Time limit exceeded
14 Halted 0 ms 0 KB -