# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584295 | denniskim | Snail (NOI18_snail) | C++17 | 1 ms | 340 KiB |
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;
typedef long double ld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
ll H, n;
ll a[10010];
ll l, r;
ll maxx;
ll sum;
int main(void)
{
scanf("%lld %lld", &H, &n);
for(ll i = 1 ; i <= n ; i++)
{
scanf("%lld", &a[i]);
sum += a[i];
}
if(sum <= 0)
{
ll h = 0;
for(ll i = 1 ; i <= n ; i++)
{
h += a[i];
h = max(h, 0LL);
if(h >= H)
{
printf("0 %lld", i - 1);
return 0;
}
}
printf("-1 -1");
return 0;
}
ll h = 0;
for(ll i = 1 ; i <= n ; i++)
{
h += a[i];
h = max(h, 0LL);
maxx = max(maxx, h);
}
ll dap = (H - maxx + sum - 1) / sum;
dap = max(dap, 0LL);
h = sum * dap;
if(h >= H)
{
printf("%lld %lld", dap - 1, n - 1);
return 0;
}
for(ll i = 1 ; i <= n ; i++)
{
h += a[i];
h = max(h, 0LL);
if(h >= H)
{
printf("%lld %lld", dap, i - 1);
return 0;
}
}
printf("-1 -1");
return 0;
}
Compilation message (stderr)
# | 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... |