Submission #199312

#TimeUsernameProblemLanguageResultExecution timeMemory
199312kshitij_sodaniPaprike (COI18_paprike)C++17
0 / 100
62 ms8440 KiB
#include <iostream> #include <bits/stdc++.h> using namespace std; typedef long long llo; #define mp make_pair #define pb push_back #define a first #define b second vector<int> adj[100001]; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,k; cin>>n>>k; int it[n]; for(int i=0;i<n;i++){ cin>>it[i]; } int aa,bb; for(int i=0;i<n-1;i++){ cin>>aa>>bb; adj[aa-1].pb(bb-1); adj[bb-1].pb(aa-1); } int tot=0; int ind=0; int co=0; while(ind<n){ tot=0; while(ind<n){ if(tot+it[ind]<=k){ ind+=1; tot+=it[ind]; } else{ break; } } co+=1; } cout<<co-1<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...