Submission #1248607

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248607		shirokito	Snail (NOI18_snail)	C++20	37 / 100	1 ms	584 KiB

snail

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 1e5 + 24;
const ll INF = 1e18;

ll n, h, a[N], pf[N];

void solve() {
    cin >> h >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pf[i] = pf[i - 1] + a[i];
    }

    ll mn = INF, s = 0;
    for (int i = 1; i <= n; i++) {
        mn = min(mn, pf[i]);
        s = max(0LL, s + a[i]);
        if (s >= h) {
            cout << 0 << ' ' << i - 1 << '\n';
            return;
        }
    }

    if (s + mn <= 0) {
        cout << -1 << ' ' << -1 << '\n';
        return;
    }

    pair<ll, ll> ans = {INF, INF};

    for (int i = 1; i <= n; i++) {
        if (pf[i] <= 0) continue;
        if (s + pf[i] >= h) {
            ans = min(ans, {1, i - 1});
        }
        else if (pf[n] > 0) {
            ll k = (h - s - pf[i] + pf[n] - 1) / pf[n];
            if (s + pf[i] + k * pf[n] >= h) ans = min(ans, {k + 1, i - 1});
        }
    }

    if (ans.first == INF) ans = {-1, -1};

    cout << ans.first << ' ' << ans.second << '\n';
}   

int main() {
    cin.tie(0) -> sync_with_stdio(0);

    #define task "file"
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }

    int T = 1; // cin >> T;
    while (T--) {
        solve();
    }
}

Compilation message (stderr)

snail.cpp: In function 'int main()':
snail.cpp:56:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
snail.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 0 / 25
• Subtask 4: 17 / 17
• Subtask 5: 0 / 38