답안 #712334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
712334	2023-03-18T15:24:19 Z	rainboy	송금 (JOI19_remittance)	C	0 / 100	1 ms	296 KB

remittance

#include <stdio.h>

#define N	1000000
#define INF	0x3f3f3f3f3f3f3f3fLL

long long min(long long a, long long b) { return a < b ? a : b; }

int solve(int *aa, int *bb, int n, long long k_) {
	int i;
	long long k, c;

	k = k_;
	for (i = n - 1; i > 0; i--) {
		if (aa[i] - k * 2 > bb[i])
			return -1;
		k = min(bb[i] - (aa[i] - k * 2), INF);
	}
	c = bb[0] - (aa[0] + k_ - k * 2);
	return c == 0 ? 0 : (c < 0 ? -1 : 1);
}

int main() {
	static int aa[N], bb[N];
	int n, i, same, zero;
	long long lower, upper;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d%d", &aa[i], &bb[i]);
	same = 1;
	for (i = 0; i < n; i++)
		if (aa[i] != bb[i]) {
			same = 0;
			break;
		}
	if (same) {
		printf("Yes\n");
		return 0;
	}
	zero = 1;
	for (i = 0; i < n; i++)
		if (bb[i] != 0) {
			zero = 0;
			break;
		}
	if (zero) {
		printf("No\n");
		return 0;
	}
	lower = -1, upper = INF;
	while (upper - lower > 1) {
		long long k = (lower + upper) / 2;

		if (solve(aa, bb, n, k) <= 0)
			lower = k;
		else
			upper = k;
	}
	printf(solve(aa, bb, n, lower) == 0 ? "Yes\n" : "No\n");
	return 0;
}

Compilation message

remittance.c: In function 'main':
remittance.c:27:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
remittance.c:29:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%d%d", &aa[i], &bb[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Incorrect	1 ms	292 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Incorrect	1 ms	292 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	292 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	296 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Incorrect	1 ms	292 KB	Output isn't correct
18	Halted	0 ms	0 KB	-