제출 #493269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493269		rainboy	Izvanzemaljci (COI21_izvanzemaljci)	C11	5 / 100	34 ms	3076 KiB

izvanzemaljci

#include <stdio.h>

#define N	100000
#define INF	0x3f3f3f3f

int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }

int main() {
	static int xx[N], yy[N];
	int n, k, i, xmn, xmx, ymn, ymx;

	scanf("%d%d", &n, &k);
	xmn = INF, xmx = -INF, ymn = INF, ymx = -INF;
	for (i = 0; i < n; i++) {
		scanf("%d%d", &xx[i], &yy[i]);
		xmn = min(xmn, xx[i]), xmx = max(xmx, xx[i]);
		ymn = min(ymn, yy[i]), ymx = max(ymx, yy[i]);
	}
	printf("%d %d %d\n", xmn, ymn, max(max(xmx - xmn, ymx - ymn), 1));
	return 0;
}

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

izvanzemaljci.c: In function 'main':
izvanzemaljci.c:13:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
izvanzemaljci.c:16:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d%d", &xx[i], &yy[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32