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>
#define ll long long
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll H; int N; cin >> H >> N;
    vector<ll> phases(N);
    vector<ll> pref(N);
    for(int i = 0;i<N;++i){
        cin >> phases[i];
        if(i == 0) pref[i] = max(0ll,phases[i]);
        else pref[i] = max(0ll,phases[i]+pref[i-1]);
    }
    if(pref[N-1] == 0){
        for(int i = 0;i<N;++i){
            if(pref[i] >= H){
                cout << 0 << " " << i << "\n";
                return 0;
            }
        }
        cout << -1 << " " << -1 << "\n";
        return 0;
    }
    ll ans = -1, p = -1;
    for(int i = 0;i<N;++i){
        ll cur = H-pref[i];
        ll d = cur/pref[N-1];
        if(cur % pref[N-1] != 0){
            ++d;
        }
        if(ans == -1 || d < ans){
            ans = d;
            p = i;
        }
    }
    cout << ans << " " << p << "\n";
    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... |