제출 #544458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
544458		rainboy	Mobile (BOI12_mobile)	C++98	100 / 100	285 ms	35280 KiB

mobile

#include <math.h>
#include <stdio.h>
 
#define N	1000000
 
double min(double a, double b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
 
int xx[N], yy[N]; long long zz[N];
 
double f(int i, int j) {
	return (double) (zz[i] - zz[j]) / (xx[i] - xx[j]) / 2;
}
 
int main() {
	static int qu[N];
	int n, x_, h, i, cnt;
	double ans;
 
	scanf("%d%d", &n, &x_);
	cnt = 0;
	for (i = 0; i < n; i++) {
		scanf("%d%d", &xx[i], &yy[i]);
		if (yy[i] < 0)
			yy[i] = -yy[i];
		zz[i] = (long long) xx[i] * xx[i] + (long long) yy[i] * yy[i];
		if (cnt && xx[i] == xx[qu[cnt - 1]]) {
			if (yy[qu[cnt - 1]] > yy[i])
				cnt--;
			else
				continue;
		}
		while (cnt >= 2 && f(qu[cnt - 2], qu[cnt - 1]) > f(qu[cnt - 1], i))
			cnt--;
		qu[cnt++] = i;
	}
	ans = 0;
	for (h = 0; h < cnt; h++) {
		double l = h == 0 ? 0 : max(f(qu[h - 1], qu[h]), 0);
		double r = h + 1 == cnt ? x_ : min(f(qu[h], qu[h + 1]), x_);
		int x = xx[qu[h]], y = yy[qu[h]];
 
		if (l <= r)
			ans = max(ans, max(hypot(x - l, y), hypot(x - r, y)));
	}
	printf("%f\n", ans);
	return 0;
}

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

mobile.cpp: In function 'int main()':
mobile.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%d%d", &n, &x_);
      |  ~~~~~^~~~~~~~~~~~~~~~~
mobile.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |   scanf("%d%d", &xx[i], &yy[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5