oj.uz

답안 #537574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537574 2022-03-15T08:51:20 Z tqbfjotld Paths (RMI21_paths) C++14
36 / 100
 600 ms 27568 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int K;

map<int,vector<int> > memo[2005];
vector<pair<int,int> > adjl[100005];

vector<int> dfs(int node, int pa){
    if (!memo[node][pa].empty()) return memo[node][pa];
    vector<int> cur;
    cur.push_back(0);
    for (auto x : adjl[node]){
        if (x.first==pa) continue;
        auto res = dfs(x.first,node);
        res[0] += x.second;
        vector<int> nw;
        int a = 0,b=0;
        while (nw.size()<K && (a<cur.size()) || (b<res.size())){
            if (a==cur.size()){
                nw.push_back(res[b]);b++;
            }
            else if (b==res.size()){
                nw.push_back(cur[a]); a++;
            }
            else if (cur[a]>res[b]){
                nw.push_back(cur[a]); a++;
            }
            else {
                nw.push_back(res[b]); b++;
            }
        }
        swap(cur,nw);
    }
    return memo[node][pa] = cur;
}

main(){
    int n;
    scanf("%lld%lld",&n,&K);
    for (int x = 0; x<n-1; x++){
        int a,b,c;
        scanf("%lld%lld%lld",&a,&b,&c);
        adjl[a].push_back({b,c});
        adjl[b].push_back({a,c});
    }
    for (int x = 1; x<=n; x++){
        auto res = dfs(x,0);
        int ans = 0;
        for (int y = 0; y<min(K,(int)res.size()); y++){
            ans += res[y];
        }
        printf("%lld\n",ans);
    }
}

Compilation message

Main.cpp: In function 'std::vector<long long int> dfs(long long int, long long int)':
Main.cpp:20:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   20 |         while (nw.size()<K && (a<cur.size()) || (b<res.size())){
      |                ~~~~~~~~~^~
Main.cpp:20:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         while (nw.size()<K && (a<cur.size()) || (b<res.size())){
      |                                ~^~~~~~~~~~~
Main.cpp:20:51: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         while (nw.size()<K && (a<cur.size()) || (b<res.size())){
      |                                                  ~^~~~~~~~~~~
Main.cpp:20:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   20 |         while (nw.size()<K && (a<cur.size()) || (b<res.size())){
      |                ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:21:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |             if (a==cur.size()){
      |                 ~^~~~~~~~~~~~
Main.cpp:24:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             else if (b==res.size()){
      |                      ~^~~~~~~~~~~~
Main.cpp: At global scope:
Main.cpp:39:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   39 | main(){
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     scanf("%lld%lld",&n,&K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%lld%lld%lld",&a,&b,&c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 3 ms 2900 KB Output is correct
5 Correct 6 ms 2880 KB Output is correct
6 Correct 3 ms 2900 KB Output is correct
7 Correct 3 ms 2884 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 3 ms 2900 KB Output is correct
5 Correct 6 ms 2880 KB Output is correct
6 Correct 3 ms 2900 KB Output is correct
7 Correct 3 ms 2884 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct
10 Correct 7 ms 4824 KB Output is correct
11 Correct 186 ms 4648 KB Output is correct
12 Correct 9 ms 5984 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 3 ms 2900 KB Output is correct
5 Correct 6 ms 2880 KB Output is correct
6 Correct 3 ms 2900 KB Output is correct
7 Correct 3 ms 2884 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct
10 Correct 7 ms 4824 KB Output is correct
11 Correct 186 ms 4648 KB Output is correct
12 Correct 9 ms 5984 KB Output is correct
13 Correct 44 ms 27568 KB Output is correct
14 Correct 30 ms 10964 KB Output is correct
15 Correct 15 ms 7508 KB Output is correct
16 Execution timed out 1100 ms 12456 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 3 ms 2900 KB Output is correct
5 Correct 6 ms 2880 KB Output is correct
6 Correct 3 ms 2900 KB Output is correct
7 Correct 3 ms 2884 KB Output is correct
8 Correct 14 ms 7032 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct
10 Correct 7 ms 4824 KB Output is correct
11 Correct 186 ms 4648 KB Output is correct
12 Correct 9 ms 5984 KB Output is correct
13 Correct 44 ms 27568 KB Output is correct
14 Correct 30 ms 10964 KB Output is correct
15 Correct 15 ms 7508 KB Output is correct
16 Execution timed out 1100 ms 12456 KB Time limit exceeded
17 Halted 0 ms 0 KB -