Submission #76783111


Source Code Expand

Copy
#include <stdio.h>
#include <inttypes.h>
int calc(int width, int tubure) {
if (width >= tubure) {
int res = (width / 2 + 1) - (tubure / 2 + 1);
if (tubure % 2 == 0) res += tubure + 1;
return res;
} else {
return tubure % 2 == 0 ? width + 1 : 0;
}
}
int main(void) {
int L, R, D, U;
uint64_t ans = 0;
int i;
if (scanf("%d%d%d%d", &L, &R, &D, &U) != 4) return 1;
for (i = D; i <= U; i++) {
int tubure = i < 0 ? -i : i;
if (L <= 0 && 0 <= R) {
ans += calc(-L, tubure) + calc(R, tubure) - calc(0, tubure);
} else if (R < 0) {
ans += calc(-L, tubure) - calc(-R - 1, tubure);
} else { /* 0 < L */
ans += calc(R, tubure) - calc(L - 1, tubure);
}
}
printf("%" PRIu64 "\n", ans);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <stdio.h>
#include <inttypes.h>

int calc(int width, int tubure) {
	if (width >= tubure) {
		int res = (width / 2 + 1) - (tubure / 2 + 1);
		if (tubure % 2 == 0) res += tubure + 1;
		return res;
	} else {
		return tubure % 2 == 0 ? width + 1 : 0;
	}
}

int main(void) {
	int L, R, D, U;
	uint64_t ans = 0;
	int i;
	if (scanf("%d%d%d%d", &L, &R, &D, &U) != 4) return 1;
	for (i = D; i <= U; i++) {
		int tubure = i < 0 ? -i : i;
		if (L <= 0 && 0 <= R) {
			ans += calc(-L, tubure) + calc(R, tubure) - calc(0, tubure);
		} else if (R < 0) {
			ans += calc(-L, tubure) - calc(-R - 1, tubure);
		} else { /* 0 < L */
			ans += calc(R, tubure) - calc(L - 1, tubure);
		}
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

Submission Info

Submission Time
Task D - Make Target 2
User mikecat
Language C23 (GCC 14.2.0)
Score 425
Code Size 754 Byte
Status AC
Exec Time 8 ms
Memory 1676 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 425 / 425
Status
AC × 2
AC × 29
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 1608 KiB
sample01.txt AC 0 ms 1640 KiB
testcase00.txt AC 8 ms 1616 KiB
testcase01.txt AC 8 ms 1568 KiB
testcase02.txt AC 2 ms 1468 KiB
testcase03.txt AC 1 ms 1608 KiB
testcase04.txt AC 8 ms 1616 KiB
testcase05.txt AC 1 ms 1604 KiB
testcase06.txt AC 1 ms 1604 KiB
testcase07.txt AC 3 ms 1676 KiB
testcase08.txt AC 3 ms 1468 KiB
testcase09.txt AC 1 ms 1568 KiB
testcase10.txt AC 3 ms 1616 KiB
testcase11.txt AC 2 ms 1616 KiB
testcase12.txt AC 8 ms 1676 KiB
testcase13.txt AC 3 ms 1568 KiB
testcase14.txt AC 2 ms 1644 KiB
testcase15.txt AC 0 ms 1556 KiB
testcase16.txt AC 6 ms 1568 KiB
testcase17.txt AC 1 ms 1616 KiB
testcase18.txt AC 2 ms 1640 KiB
testcase19.txt AC 2 ms 1616 KiB
testcase20.txt AC 3 ms 1676 KiB
testcase21.txt AC 2 ms 1568 KiB
testcase22.txt AC 0 ms 1604 KiB
testcase23.txt AC 1 ms 1568 KiB
testcase24.txt AC 0 ms 1484 KiB
testcase25.txt AC 4 ms 1616 KiB
testcase26.txt AC 3 ms 1620 KiB


2026-06-19 (Fri)
21:49:23 +09:00