제출 #584308

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584308		denniskim	Snail (NOI18_snail)	C++17	100 / 100	2 ms	468 KiB

snail

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 11
• Subtask 2: 9 / 9
• Subtask 3: 25 / 25
• Subtask 4: 17 / 17
• Subtask 5: 38 / 38