oj.uz

Submission #256646

# Submission time Handle Problem Language Result Execution time Memory
256646 2020-08-03T04:55:33 Z uacoder123 Paprike (COI18_paprike) C++14
100 / 100
 100 ms 44664 KB 
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    using namespace std;
    using namespace __gnu_pbds;
    #define F first
    #define S second
    #define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
    #define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
    #define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
  
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
vi al[100001];
lli val[100001],ans=0;
vi v[1000001];
int n,k;
void dfs(int node,int par)
{
  for(int i=0;i<al[node].size();++i)
  {
    if(al[node][i]!=par)
    {
      dfs(al[node][i],node);
      val[node]+=val[al[node][i]];
      v[node].pb(val[al[node][i]]);
    }
  }
  sort(all(v[node]));
  while(val[node]>k)
  {
    val[node]-=v[node].back();
    v[node].pop_back();
    ans++;
  }
  v[node].clear();
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin>>n>>k;
  for(int i=1;i<=n;++i)
    cin>>val[i];
  for(int i=0;i<n-1;++i)
  {
    int f,s;
    cin>>f>>s;
    al[f].pb(s);
    al[s].pb(f);
  }
  dfs(1,1);
  cout<<ans<<endl;
  return(0);
}

Compilation message

paprike.cpp: In function 'void dfs(int, int)':
paprike.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<al[node].size();++i)
               ~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 44536 KB Output is correct
2 Correct 88 ms 44632 KB Output is correct
3 Correct 80 ms 44664 KB Output is correct
4 Correct 77 ms 44664 KB Output is correct
5 Correct 77 ms 44536 KB Output is correct
6 Correct 74 ms 44536 KB Output is correct
7 Correct 77 ms 44536 KB Output is correct
8 Correct 70 ms 44024 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 26112 KB Output is correct
2 Correct 16 ms 26112 KB Output is correct
3 Correct 16 ms 26112 KB Output is correct
4 Correct 16 ms 26112 KB Output is correct
5 Correct 16 ms 26112 KB Output is correct
6 Correct 19 ms 26112 KB Output is correct
7 Correct 16 ms 26112 KB Output is correct
8 Correct 16 ms 26112 KB Output is correct
9 Correct 16 ms 26112 KB Output is correct
10 Correct 21 ms 26112 KB Output is correct
11 Correct 21 ms 26112 KB Output is correct
12 Correct 16 ms 26112 KB Output is correct
13 Correct 16 ms 26112 KB Output is correct
14 Correct 16 ms 26112 KB Output is correct
15 Correct 18 ms 26200 KB Output is correct
16 Correct 18 ms 26112 KB Output is correct
17 Correct 16 ms 26240 KB Output is correct
18 Correct 16 ms 26240 KB Output is correct
19 Correct 16 ms 26112 KB Output is correct
20 Correct 17 ms 26112 KB Output is correct
21 Correct 19 ms 26112 KB Output is correct
22 Correct 75 ms 44536 KB Output is correct
23 Correct 88 ms 44632 KB Output is correct
24 Correct 80 ms 44664 KB Output is correct
25 Correct 77 ms 44664 KB Output is correct
26 Correct 77 ms 44536 KB Output is correct
27 Correct 74 ms 44536 KB Output is correct
28 Correct 77 ms 44536 KB Output is correct
29 Correct 70 ms 44024 KB Output is correct
30 Correct 16 ms 26240 KB Output is correct
31 Correct 18 ms 26368 KB Output is correct
32 Correct 17 ms 26240 KB Output is correct
33 Correct 19 ms 26232 KB Output is correct
34 Correct 20 ms 26240 KB Output is correct
35 Correct 17 ms 26240 KB Output is correct
36 Correct 20 ms 26240 KB Output is correct
37 Correct 22 ms 26240 KB Output is correct
38 Correct 20 ms 26240 KB Output is correct
39 Correct 17 ms 26232 KB Output is correct
40 Correct 18 ms 26240 KB Output is correct
41 Correct 20 ms 26240 KB Output is correct
42 Correct 20 ms 26240 KB Output is correct
43 Correct 20 ms 26240 KB Output is correct
44 Correct 17 ms 26240 KB Output is correct
45 Correct 20 ms 26240 KB Output is correct
46 Correct 22 ms 26240 KB Output is correct
47 Correct 75 ms 37880 KB Output is correct
48 Correct 76 ms 36472 KB Output is correct
49 Correct 77 ms 35832 KB Output is correct
50 Correct 81 ms 35576 KB Output is correct
51 Correct 90 ms 34552 KB Output is correct
52 Correct 100 ms 34552 KB Output is correct
53 Correct 90 ms 34552 KB Output is correct
54 Correct 91 ms 34424 KB Output is correct
55 Correct 89 ms 34040 KB Output is correct
56 Correct 86 ms 34040 KB Output is correct
57 Correct 57 ms 34032 KB Output is correct