oj.uz

Submission #44056

# Submission time Handle Problem Language Result Execution time Memory
44056 2018-03-29T13:05:45 Z Lkvatashidze Paprike (COI18_paprike) C++11
100 / 100
 122 ms 20964 KB 
#include <bits/stdc++.h>
using namespace std;

      void DFS(int,int);

      int a[100005], dp[100005];
      int n, Q;
      vector < vector < int > > g;
      int cnt;

int main() {


       ios_base::sync_with_stdio(false);
      
        cin >> n >> Q;

         g.resize(n+1);

     for (int k=1; k<=n; k++)
         cin >> a[k];

         for (int k=1; k<n; k++) {
            int x, y;
             cin >> x >> y;
             g[x].push_back(y);
             g[y].push_back(x);
         }

         DFS(1,-1);

         cout << cnt;

    return 0;
}

 void DFS (int v, int p) {
        dp[v]=a[v];

       multiset < int > st;

     for (int k=0; k<g[v].size(); k++) {
         int to=g[v][k];
         if (to==p) continue;
         DFS(to,v);
          st.insert(dp[to]);
         }
         
     while (!st.empty()) {
        int q=(*st.begin());
        if (dp[v]+q<=Q) {
            dp[v]+=q;
        } else {
             cnt++;
         }
         st.erase(st.begin());
     }
}

Compilation message

paprike.cpp: In function 'int main()':
paprike.cpp:20:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
      for (int k=1; k<=n; k++)
      ^~~
paprike.cpp:23:10: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
          for (int k=1; k<n; k++) {
          ^~~
paprike.cpp: In function 'void DFS(int, int)':
paprike.cpp:42:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k=0; k<g[v].size(); k++) {
                    ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 2 ms 656 KB Output is correct
18 Correct 2 ms 656 KB Output is correct
19 Correct 2 ms 656 KB Output is correct
20 Correct 2 ms 656 KB Output is correct
21 Correct 2 ms 656 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 20948 KB Output is correct
2 Correct 72 ms 20948 KB Output is correct
3 Correct 71 ms 20964 KB Output is correct
4 Correct 74 ms 20964 KB Output is correct
5 Correct 70 ms 20964 KB Output is correct
6 Correct 69 ms 20964 KB Output is correct
7 Correct 66 ms 20964 KB Output is correct
8 Correct 64 ms 20964 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 2 ms 656 KB Output is correct
18 Correct 2 ms 656 KB Output is correct
19 Correct 2 ms 656 KB Output is correct
20 Correct 2 ms 656 KB Output is correct
21 Correct 2 ms 656 KB Output is correct
22 Correct 2 ms 20964 KB Output is correct
23 Correct 2 ms 20964 KB Output is correct
24 Correct 3 ms 20964 KB Output is correct
25 Correct 3 ms 20964 KB Output is correct
26 Correct 2 ms 20964 KB Output is correct
27 Correct 2 ms 20964 KB Output is correct
28 Correct 3 ms 20964 KB Output is correct
29 Correct 2 ms 20964 KB Output is correct
30 Correct 2 ms 20964 KB Output is correct
31 Correct 2 ms 20964 KB Output is correct
32 Correct 2 ms 20964 KB Output is correct
33 Correct 2 ms 20964 KB Output is correct
34 Correct 2 ms 20964 KB Output is correct
35 Correct 2 ms 20964 KB Output is correct
36 Correct 2 ms 20964 KB Output is correct
37 Correct 2 ms 20964 KB Output is correct
38 Correct 3 ms 20964 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 2 ms 656 KB Output is correct
18 Correct 2 ms 656 KB Output is correct
19 Correct 2 ms 656 KB Output is correct
20 Correct 2 ms 656 KB Output is correct
21 Correct 2 ms 656 KB Output is correct
22 Correct 68 ms 20948 KB Output is correct
23 Correct 72 ms 20948 KB Output is correct
24 Correct 71 ms 20964 KB Output is correct
25 Correct 74 ms 20964 KB Output is correct
26 Correct 70 ms 20964 KB Output is correct
27 Correct 69 ms 20964 KB Output is correct
28 Correct 66 ms 20964 KB Output is correct
29 Correct 64 ms 20964 KB Output is correct
30 Correct 2 ms 20964 KB Output is correct
31 Correct 2 ms 20964 KB Output is correct
32 Correct 3 ms 20964 KB Output is correct
33 Correct 3 ms 20964 KB Output is correct
34 Correct 2 ms 20964 KB Output is correct
35 Correct 2 ms 20964 KB Output is correct
36 Correct 3 ms 20964 KB Output is correct
37 Correct 2 ms 20964 KB Output is correct
38 Correct 2 ms 20964 KB Output is correct
39 Correct 2 ms 20964 KB Output is correct
40 Correct 2 ms 20964 KB Output is correct
41 Correct 2 ms 20964 KB Output is correct
42 Correct 2 ms 20964 KB Output is correct
43 Correct 2 ms 20964 KB Output is correct
44 Correct 2 ms 20964 KB Output is correct
45 Correct 2 ms 20964 KB Output is correct
46 Correct 3 ms 20964 KB Output is correct
47 Correct 68 ms 20964 KB Output is correct
48 Correct 68 ms 20964 KB Output is correct
49 Correct 72 ms 20964 KB Output is correct
50 Correct 93 ms 20964 KB Output is correct
51 Correct 122 ms 20964 KB Output is correct
52 Correct 91 ms 20964 KB Output is correct
53 Correct 92 ms 20964 KB Output is correct
54 Correct 86 ms 20964 KB Output is correct
55 Correct 75 ms 20964 KB Output is correct
56 Correct 91 ms 20964 KB Output is correct
57 Correct 70 ms 20964 KB Output is correct