Submission #72415339

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#define COORD_MAX 5123
int n;
int x[3123], y[3123];
char exists[COORD_MAX][COORD_MAX];
int is_exist(int y, int x) {
  if (y < 0 || COORD_MAX <= y || x < 0 || COORD_MAX <= x) return 0;
  return exists[y][x];
}
int main(void) {
  int i, j;
  int ans = 0;
  if (scanf("%d", &n) != 1) return 1;
  for (i = 0; i < n; i++) {
    if (scanf("%d%d", &x[i], &y[i]) != 2) return 1;
    exists[y[i]][x[i]] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

#define COORD_MAX 5123

int n;
int x[3123], y[3123];

char exists[COORD_MAX][COORD_MAX];

int is_exist(int y, int x) {
	if (y < 0 || COORD_MAX <= y || x < 0 || COORD_MAX <= x) return 0;
	return exists[y][x];
}

int main(void) {
	int i, j;
	int ans = 0;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 0; i < n; i++) {
		if (scanf("%d%d", &x[i], &y[i]) != 2) return 1;
		exists[y[i]][x[i]] = 1;
	}
	for (i = 0; i < n; i++) {
		for (j = i + 1; j < n; j++) {
			int dx = x[j] - x[i], dy = y[j] - y[i];
			int x1 = x[i] + dy, y1 = y[i] - dx;
			int x2 = x[j] + dy, y2 = y[j] - dx;
			if (is_exist(y1, x1) && is_exist(y2, x2)) {
				int score = dx * dx + dy * dy;
				if (score > ans) ans = score;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result