oj.uz

답안 #676815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676815 2023-01-01T08:53:40 Z peteza Paprike (COI18_paprike) C++14
100 / 100
 113 ms 19564 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k, a, b;
int val[100005];
vector<int> vec[100005];
int DP[100005]; //numbers of scoville taken

int dfs(int cn, int par = -1) {
    //returns minimum cut to make this tree
    if(vec[cn].size() == 1 && vec[cn][0] == par) {
        DP[cn] = val[cn];
        return 0;
    } //is a leaf node!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1
    int sum = 0, scovavail = k-val[cn];
    vector<int> sco;
    for(int e:vec[cn]) {
        if(e == par) continue;
        sum += dfs(e, cn);
        sco.push_back(DP[e]);
    }
    sort(sco.begin(), sco.end());
    //for(int e:sco) cout << e << ", "; cout << '\n';
    int i;
    for(i=0;i<sco.size() && scovavail >= sco[i];i++)scovavail -= sco[i];//cout << "Scoville available of " << i << "-> "<<sco[i] << '\n';
    //cout << "total scov = " << scovavail << '\n';
    DP[cn] = k-scovavail;
    //cout << cn << " -> " << sum << " + " << sco.size()-i << '\n';
    //cout << "--->" << DP[cn] << '\n';
    return sum+=sco.size()-i;
}

int main() {
    //ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> val[i];
    for(int i=1;i<n;i++) {
        cin >> a >> b;
        vec[a].push_back(b);
        vec[b].push_back(a);
    }
    cout << dfs(1);
}

Compilation message

paprike.cpp: In function 'int dfs(int, int)':
paprike.cpp:25:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(i=0;i<sco.size() && scovavail >= sco[i];i++)scovavail -= sco[i];//cout << "Scoville available of " << i << "-> "<<sco[i] << '\n';
      |             ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2656 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2660 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 19404 KB Output is correct
2 Correct 103 ms 19384 KB Output is correct
3 Correct 106 ms 19564 KB Output is correct
4 Correct 104 ms 19404 KB Output is correct
5 Correct 102 ms 19328 KB Output is correct
6 Correct 99 ms 19312 KB Output is correct
7 Correct 106 ms 19380 KB Output is correct
8 Correct 84 ms 18888 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2656 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2660 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 2 ms 2692 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 3 ms 2672 KB Output is correct
28 Correct 3 ms 2644 KB Output is correct
29 Correct 2 ms 2664 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 3 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2656 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2660 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 113 ms 19404 KB Output is correct
23 Correct 103 ms 19384 KB Output is correct
24 Correct 106 ms 19564 KB Output is correct
25 Correct 104 ms 19404 KB Output is correct
26 Correct 102 ms 19328 KB Output is correct
27 Correct 99 ms 19312 KB Output is correct
28 Correct 106 ms 19380 KB Output is correct
29 Correct 84 ms 18888 KB Output is correct
30 Correct 2 ms 2668 KB Output is correct
31 Correct 2 ms 2692 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 3 ms 2672 KB Output is correct
36 Correct 3 ms 2644 KB Output is correct
37 Correct 2 ms 2664 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 3 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 99 ms 12496 KB Output is correct
48 Correct 103 ms 10776 KB Output is correct
49 Correct 98 ms 10040 KB Output is correct
50 Correct 98 ms 9640 KB Output is correct
51 Correct 110 ms 8572 KB Output is correct
52 Correct 104 ms 8612 KB Output is correct
53 Correct 102 ms 8428 KB Output is correct
54 Correct 103 ms 8464 KB Output is correct
55 Correct 88 ms 8012 KB Output is correct
56 Correct 88 ms 7988 KB Output is correct
57 Correct 81 ms 9140 KB Output is correct