제출 #390258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390258		fadi57	Paprike (COI18_paprike)	C++14	13 / 100	126 ms	8164 KiB

paprike

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll mx=1e5+10;
const int mod= 1e9+7 ;
const ll inf=1e9+5;
//***while there is life there is hope

int n,m,k;
int siz[mx];
vector<int> adj[mx];

int a[mx];
int main() {

cin>>n>>k;
for(int i=1;i<=n;i++){
    cin>>a[i];
}
for(int i=0;i<n-1;i++){
    int a,b;cin>>a>>b;

    adj[a].push_back(b);
    adj[b].push_back(a);

 }
int sum=0;int ans=0;
for(int i=1;i<=n;i++){
    sum+=a[i];
    if(sum>k){sum=a[i];ans++;}
}
cout<<ans;



 }

• Subtask 1: 0 / 11
• Subtask 2: 13 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49