oj.uz

Submission #584308

# Submission time Handle Problem Language Result Execution time Memory
584308 2022-06-27T07:37:33 Z denniskim Snail (NOI18_snail) C++17
100 / 100
 2 ms 468 KB 
#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 h, h2;
ll sum;

int main(void)
{
	scanf("%lld %lld", &H, &n);
	
	for(ll i = 1 ; i <= n ; i++)
	{
		scanf("%lld", &a[i]);
		sum += a[i];
	}
	
	for(ll i = 1 ; i <= n ; i++)
	{
		h += a[i];
		h = max(h, 0LL);
		
		if(h >= H)
		{
			printf("0 %lld", i - 1);
			return 0;
		}
	}
	
	if(h == 0)
	{
		printf("-1 -1");
		return 0;
	}
	
	h2 = h;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		h2 += a[i];
		h2 = max(h2, 0LL);
		
		if(h2 >= H)
		{
			printf("1 %lld", i - 1);
			return 0;
		}
	}
	
	if(h2 <= h)
	{
		printf("-1 -1");
		return 0;
	}
	
	ll l = 1, r = 1000000000000 / sum + 5;
	
	while(l + 1 < r)
	{
		ll mid = (l + r) / 2;
		ll w = (mid - 1) * sum + h;
		ll ff = 0;
		
		for(ll i = 1 ; i <= n ; i++)
		{
			w += a[i];
			
			if(w >= H)
				ff = 1;
		}
		
		if(ff)
			r = mid;
		else
			l = mid;
	}
	
	ll w = (r - 1) * sum + h;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		w += a[i];
		
		if(w >= H)
		{
			printf("%lld %lld", r, i - 1);
			return 0;
		}
	}
	
	return 0;
}

Compilation message

snail.cpp: In function 'int main()':
snail.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%lld %lld", &H, &n);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
snail.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%lld", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 316 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #5
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 272 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 316 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct