oj.uz

답안 #572851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572851 2022-06-05T11:42:28 Z denniskim Coins (BOI06_coins) C++17
80 / 100
 90 ms 8108 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 n, k;
pair<ll, ll> a[500010];
ll ans1, ans2;

int main(void)
{
	scanf("%lld %lld", &n, &k);
	
	for(ll i = 1 ; i <= n ; i++)
		scanf("%lld %lld", &a[i].fi, &a[i].se);
	
	for(ll i = 1 ; i <= n ; i++)
	{
		if(a[i].se)
			continue;
		
		if(ans1 + a[i].fi < min(a[i + 1].fi, k))
		{
			ans1 += a[i].fi;
			ans2++;
		}
	}
	
	if(!ans1)
		ans1 = 1;
	
	printf("%lld\n%lld", ans2, k - ans1);
	return 0;
}

Compilation message

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

Subtask #1
80.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't 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 Incorrect 86 ms 8108 KB Output isn't correct
8 Correct 86 ms 8040 KB Output is correct
9 Correct 88 ms 8016 KB Output is correct
10 Correct 90 ms 7988 KB Output is correct