oj.uz

답안 #626560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626560 2022-08-11T14:36:12 Z tamthegod Paths (RMI21_paths) C++17
68 / 100
 298 ms 38196 KB 
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, k;
vector<pair<int, int>> adj[maxN];
int f[maxN], dp[maxN];
void ReadInput()
{
    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});
    }
}
void predfs(int u, int par)
{
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par) continue;
        predfs(v, u);
        f[u] = max(f[u], f[v] + w);
    }
}
void predfs1(int u, int par)
{
    vector<pair<int, int>> vc;
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par) continue;
        vc.pb({f[v] + w, v});
    }
    sort(vc.begin(), vc.end(), greater<pair<int, int>>());
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par) continue;
        if(v != vc[0].se) dp[v] = max(dp[u] + w, vc[0].fi + w);
        else dp[v] = max(dp[u] + w, vc[1].fi + w);
        predfs1(v, u);
    }
}
multiset<int, greater<int>> s, s1;
void dfs(int u, int par, int root)
{
    int _max = 0, id = 0;
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par) continue;
        dfs(v, u, root);
        if(f[v] + w > _max)
        {
            _max = f[v] + w;
            id = v;
        }
    }
   // cout << u << " " << _max << "\n";
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par || v == id) continue;
        s.insert(f[v] + w);
    }
    if(u == root) s.insert(f[u]);
}
int res[maxN], sum = 0;
void add(int val)
{
    if(s.size() < k)
    {
        s.insert(val);
        sum += val;
        return;
    }
    auto it = s.end();
    it--;
    if(*it < val)
    {
        sum -= *it;
        sum += val;
        s1.insert(*it);
        s.insert(val);
        s.erase(it);
    }
    else s1.insert(val);
}
void del(int val)
{
    if(s.find(val) != s.end())
    {
        sum -= val;
        s.erase(s.find(val));
        if(s1.empty()) return;
        sum += *s1.begin();
        s.insert(*s1.begin());
        s1.erase(s1.begin());
    }
    else if(s1.find(val) != s1.end()) s1.erase(s1.find(val));
}
void reroot(int u, int par)
{
    res[u] = sum;
    for(auto a : adj[u])
    {
        int v = a.fi, w = a.se;
        if(v == par) continue;
        add(f[v]);
        del(f[v] + w);
        add(dp[v]);
        del(dp[v] - w);
        reroot(v, u);
        add(f[v] + w);
        del(f[v]);
        add(dp[v] - w);
        del(dp[v]);
    }
}
void Solve()
{
    predfs(n, 0);
    predfs1(n, 0);
    dfs(n, 0, n);
    for(int v : s) sum += v;
    while(s.size() > k)
    {
        auto it = s.end();
        it--;
        sum -= *it;
        s1.insert(*it);
        s.erase(it);
    }
    //for(int v : s1) cout << v << " ";return;
    reroot(n, 0);
    for(int i=1; i<=n; i++) cout << res[i] << '\n';
}
int32_t main()
{
   // freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Compilation message

Main.cpp: In function 'void add(long long int)':
Main.cpp:85:17: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   85 |     if(s.size() < k)
      |        ~~~~~~~~~^~~
Main.cpp: In function 'void Solve()':
Main.cpp:140:20: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  140 |     while(s.size() > k)
      |           ~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23780 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23780 KB Output is correct
8 Correct 14 ms 23844 KB Output is correct
9 Correct 14 ms 23892 KB Output is correct
10 Correct 13 ms 23856 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 14 ms 23856 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23780 KB Output is correct
8 Correct 14 ms 23844 KB Output is correct
9 Correct 14 ms 23892 KB Output is correct
10 Correct 13 ms 23856 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 14 ms 23856 KB Output is correct
13 Correct 15 ms 24020 KB Output is correct
14 Correct 16 ms 24140 KB Output is correct
15 Correct 15 ms 23932 KB Output is correct
16 Correct 19 ms 24000 KB Output is correct
17 Correct 15 ms 24020 KB Output is correct
18 Correct 15 ms 23928 KB Output is correct
19 Correct 19 ms 24040 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 34856 KB Output is correct
2 Correct 223 ms 36500 KB Output is correct
3 Correct 155 ms 32796 KB Output is correct
4 Correct 210 ms 34708 KB Output is correct
5 Correct 231 ms 36304 KB Output is correct
6 Correct 256 ms 34828 KB Output is correct

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23764 KB Output is correct
2 Correct 12 ms 23824 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 12 ms 23780 KB Output is correct
8 Correct 14 ms 23844 KB Output is correct
9 Correct 14 ms 23892 KB Output is correct
10 Correct 13 ms 23856 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 14 ms 23856 KB Output is correct
13 Correct 15 ms 24020 KB Output is correct
14 Correct 16 ms 24140 KB Output is correct
15 Correct 15 ms 23932 KB Output is correct
16 Correct 19 ms 24000 KB Output is correct
17 Correct 15 ms 24020 KB Output is correct
18 Correct 15 ms 23928 KB Output is correct
19 Correct 19 ms 24040 KB Output is correct
20 Correct 222 ms 34856 KB Output is correct
21 Correct 223 ms 36500 KB Output is correct
22 Correct 155 ms 32796 KB Output is correct
23 Correct 210 ms 34708 KB Output is correct
24 Correct 231 ms 36304 KB Output is correct
25 Correct 256 ms 34828 KB Output is correct
26 Correct 292 ms 35124 KB Output is correct
27 Correct 298 ms 37580 KB Output is correct
28 Incorrect 262 ms 38196 KB Output isn't correct
29 Halted 0 ms 0 KB -