제출 #1294019

#제출 시각아이디문제언어결과실행 시간메모리
1294019lale_7Paprike (COI18_paprike)C++20
13 / 100
24 ms6528 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int MAX=1e5+5; vector<int>vt[MAX]; void solve(){ int n,k; cin>>n>>k; int arr[n+1]; for(int i=1;i<=n;i++){ cin>>arr[i]; } for(int i=1;i<=n;i++){ int x,y; cin>>x>>y; vt[y].push_back(x); vt[x].push_back(y); } int say=0; int cem=0; for(int i=1;i<=n;i++){ if(cem+arr[i]<=k){ cem+=arr[i]; } else{ say++; cem=arr[i]; } } cout<<say<<endl; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; //cin>>t; while(t--){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...