제출 #995132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995132		Nexus	Paprike (COI18_paprike)	C++17	13 / 100	21 ms	4700 KiB

paprike

#include <bits/stdc++.h>
#define ll long long
#define some_one https://codeforces.com/problemset/problem/1575/J

using namespace std;

const ll N=1e6+9,M=2e18+9,L=18,mod=1e9+7;

ll a[N],n,k,x,y,z;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	
	cin>>n>>k;
	for(ll i=0;i<n;++i)
	cin>>a[i];
	for(ll i=1;i<n;++i)cin>>x>>y;
	x=0,y=0;
	for(ll i=0;i<n;++i)
	{
		y+=a[i];
		if(y>k)y=a[i],++x;
	}
	cout<<x;
}
//hocln and wesam hate cp
//and another thing!
//jeowesam+some_one=Love
//Nice,yep?

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