제출 #584285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584285		denniskim	Snail (NOI18_snail)	C++17	37 / 100	2 ms	340 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 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];
			
			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];
		maxx = max(maxx, h);
	}
	
	ll dap = (H - maxx) / 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];
		
		if(h >= H)
		{
			printf("%lld %lld", dap, i - 1);
			return 0;
		}
	}
	
	dap++;
	
	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];
		
		if(h >= H)
		{
			printf("%lld %lld", dap, i - 1);
			return 0;
		}
	}
	
	printf("-1 -1");
	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: 0 / 25
• Subtask 4: 17 / 17
• Subtask 5: 0 / 38