제출 #594172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594172		Zanite	Collecting Stamps 3 (JOI20_ho_t3)	C++17	0 / 100	1 ms	212 KiB

ho_t3

// I am now here, but I have yet to prove that I am worthy of my place here.

#include <bits/stdc++.h>
using namespace std;

using ll	= long long;
using pll	= pair<ll, ll>;

#define fi	first
#define se	second

const int maxN	= 201;

const ll INF	= 1e18;

ll N, L;
pll stamps[maxN];
ll CW[maxN], CCW[maxN];
ll dp[maxN][maxN];

int main() {
	scanf("%lld %lld", &N, &L);
	for (ll i = 1; i <= N; i++) {scanf("%lld", &stamps[i].fi);}
	for (ll i = 1; i <= N; i++) {scanf("%lld", &stamps[i].se);}
	sort(stamps + 1, stamps + N+1);

	for (ll i = 1; i <= N; i++) {
		CW[i] = stamps[i].fi;
		CCW[i] = L - CW[i];
	}

	ll ans = 0;

	// clockwise
	for (ll en = 1; en <= N; en++) {
		ll cur = 0;
		for (ll i = 1; i <= en; i++) {
			if (CW[i] <= stamps[i].se) cur++;
		}
		ll d = 2*CW[en];
		for (ll i = N; i > en; i--) {
			if (d+CCW[i] <= stamps[i].se) cur++;
		}
		ans = max(ans, cur);
	}

	// counterclockwise
	for (ll en = 1; en <= N; en++) {
		ll cur = 0;
		for (ll i = N; i >= en; i--) {
			if (CCW[i] <= stamps[i].se) cur++;
		}
		ll d = 2*CCW[en];
		for (ll i = 1; i < N; i++) {
			if (d+CW[i] <= stamps[i].se) cur++;
		}
		ans = max(ans, cur);
	}

	printf("%lld\n", ans);
}

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

ho_t3.cpp: In function 'int main()':
ho_t3.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%lld %lld", &N, &L);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:23:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |  for (ll i = 1; i <= N; i++) {scanf("%lld", &stamps[i].fi);}
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:24:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  for (ll i = 1; i <= N; i++) {scanf("%lld", &stamps[i].se);}
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75