oj.uz

답안 #645258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
645258 2022-09-26T14:34:49 Z PanTkd Paths (RMI21_paths) C++14
36 / 100
 600 ms 15580 KB 
//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
#ifdef px
    #define p(x) cerr<<#x<<' '<<x<<endl;
#else
    #define p(x) {}
#endif
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
///////////////////////////////////////////////////////////////////////
ll N,K;
vector<vii> Adj;
multiset<ll> ms;
ii mp(ll x,ll y){
    ii temp;
    temp.F=x,temp.S=y;
    return temp;
}
ll maxi[10001]={};
void dfs(ll s,ll p){
    maxi[s]=0;
    bool leaf=1;
    for(auto pp: Adj[s]){
        if(pp.F==p)continue;
        leaf=0;
        dfs(pp.F,s);
        ms.erase(ms.find(maxi[pp.F]));
        ms.insert(maxi[pp.F]+pp.S);
        maxi[s]=max(maxi[s],maxi[pp.F]+pp.S);
    }   
    if(leaf){
        ms.insert(0);
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin>>N>>K;
    Adj.assign(N+1,vii());

    for(ll i=1;i<N;i++){
        ll a,b,c;cin>>a>>b>>c;

        Adj[a].push_back(mp(b,c));
        Adj[b].push_back(mp(a,c));
    }


    for(ll i=1;i<=N;i++){
        ms.clear();
        dfs(i,0);
        vi v;
        
        ll ans=0;
        while (ms.size() > K) {
            ms.erase(ms.begin());
        }
        for (ll x : ms) {
            ans += x;
        }
        cout<<ans<<endl;
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:91:26: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   91 |         while (ms.size() > K) {
      |                ~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 7 ms 324 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 7 ms 324 KB Output is correct
8 Correct 160 ms 448 KB Output is correct
9 Correct 111 ms 496 KB Output is correct
10 Correct 126 ms 452 KB Output is correct
11 Correct 155 ms 448 KB Output is correct
12 Correct 135 ms 456 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 7 ms 324 KB Output is correct
8 Correct 160 ms 448 KB Output is correct
9 Correct 111 ms 496 KB Output is correct
10 Correct 126 ms 452 KB Output is correct
11 Correct 155 ms 448 KB Output is correct
12 Correct 135 ms 456 KB Output is correct
13 Execution timed out 694 ms 836 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 47 ms 15580 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 7 ms 324 KB Output is correct
8 Correct 160 ms 448 KB Output is correct
9 Correct 111 ms 496 KB Output is correct
10 Correct 126 ms 452 KB Output is correct
11 Correct 155 ms 448 KB Output is correct
12 Correct 135 ms 456 KB Output is correct
13 Execution timed out 694 ms 836 KB Time limit exceeded
14 Halted 0 ms 0 KB -