This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,n;cin>>h>>n;
vector<long long int>v(n);
long long int used=0, Max=0;
for(int i=0;i<n;i++){
cin>>v[i];
used+=v[i];
if(used>Max)Max=used;
}
if(used<=0 && Max<h && h>0){
cout<<"-1 -1";
return 0;
}
long long int days_required;
if(h-Max%used>0){
days_required = (h-Max)/used+1;
}
else days_required = (h-Max)/used;
cout<<days_required<<" ";
int now = days_required*used;
if(now>=h){cout<<0;return 0;}
for(int i=0;i<n;i++){
now+=v[i];
if(now>=h){cout<<i;return 0;}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |