This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll h;
int n;
cin >> h >> n;
vector<ll> p(n);
vector<ll> ps(n);
ll hr = 0;
int day = 0, phs = 0;
bool reach = 0;
for(int i = 0; i < n; ++i)
{
cin >> p[i];
if(i == 0)
ps[i] = p[i];
else
ps[i] = ps[i-1] + p[i];
if(!reach)
hr += p[i];
if(hr < 0)
{
hr = 0;
}
if(hr >= h)
{
cout << "0 " << phs << '\n';
reach = 1;
}
++phs;
}
if(reach)
return 0;
if(hr == 0)
{
cout << "-1 -1\n";
return 0;
}
day = 1;
while(!reach)
{
phs = 0;
for(int i = 0; i < n; ++i)
{
hr += p[i];
if(hr >= h)
{
cout << day << " " << phs << '\n';
reach = 1;
return 0;
}
if(hr < 0)
{
hr = 0;
}
++phs;
}
++day;
}
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... |