oj.uz

Submission #485390

# Submission time Handle Problem Language Result Execution time Memory
485390 2021-11-07T15:03:19 Z rainboy Kosta (COI14_kosta) C
48 / 100
 5000 ms 1832 KB 
#include <stdio.h>

#define N1	200000
#define N2	50000
#define LG	16	/* LG = ceil(log2(N2)) */
#define N_	(1 + N2 * (LG + 1))
#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 abs_(int a) { return a > 0 ? a : -a; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int xx[N1], yy[N1], xx_[N2], yy_[N2], n;

int t, u, v;

int check(int d) {
	if (t == 1) {
		int i, xmn, xmx, ymn, ymx;

		xmn = INF, xmx = -INF, ymn = INF, ymx = -INF;
		for (i = 0; i < n; i++) {
			xmn = min(xmn, xx[i]), xmx = max(xmx, xx[i]);
			ymn = min(ymn, yy[i]), ymx = max(ymx, yy[i]);
		}
		u = -1;
		for (i = 0; i < n; i++)
			if (xx[i] - xmn <= d && xmx - xx[i] <= d && yy[i] - ymn <= d && ymx - yy[i] <= d) {
				u = i;
				return 1;
			}
		return 0;
	} else {
		int i;

		for (u = 0; u < n; u++) {
			int xmn = INF, xmx = -INF, ymn = INF, ymx = -INF;

			for (i = 0; i < n; i++) {
				if (max(abs_(xx[i] - xx[u]), abs_(yy[i] - yy[u])) <= d)
					continue;
				xmn = min(xmn, xx[i]), xmx = max(xmx, xx[i]);
				ymn = min(ymn, yy[i]), ymx = max(ymx, yy[i]);
			}
			v = -1;
			for (i = 0; i < n; i++)
				if (xx[i] - xmn <= d && xmx - xx[i] <= d && yy[i] - ymn <= d && ymx - yy[i] <= d) {
					v = i;
					return 1;
				}
		}
		return 0;
	}
}

int *zz;

void sort(int *ii, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (zz[ii[j]] == zz[i_])
				j++;
			else if (zz[ii[j]] < zz[i_]) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		sort(ii, l, i);
		l = k;
	}
}

int main() {
	static int ii[N2], jj[N2];
	int i, j, lower, upper;

	scanf("%d%d", &t, &n);
	for (i = 0; i < n; i++) {
		int x, y;

		scanf("%d%d", &x, &y);
		xx[i] = x + y, yy[i] = x - y;
	}
	if (t == 2) {
		for (i = 0; i < n; i++)
			ii[i] = i;
		zz = xx, sort(ii, 0, n);
		for (i = 0; i < n; i++)
			xx_[ii[i]] = i;
		for (j = 0; j < n; j++)
			jj[j] = j;
		zz = yy, sort(jj, 0, n);
		for (j = 0; j < n; j++)
			yy_[jj[j]] = j;
	}
	lower = -1, upper = INF;
	while (upper - lower > 1) {
		int d = (lower + upper) / 2;

		if (check(d))
			upper = d;
		else
			lower = d;
	}
	check(upper);
	printf("%d\n", upper);
	if (t == 1)
		printf("%d\n", u + 1);
	else
		printf("%d %d\n", u + 1, v + 1);
	return 0;
}

Compilation message

kosta.c: In function 'main':
kosta.c:87:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |  scanf("%d%d", &t, &n);
      |  ^~~~~~~~~~~~~~~~~~~~~
kosta.c:91:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |   scanf("%d%d", &x, &y);
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 1200 KB Output is correct
2 Correct 39 ms 1208 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 1832 KB Output is correct
2 Correct 71 ms 1716 KB Output is correct

Subtask #5
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #6
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1050 ms 352 KB Output is correct
2 Correct 971 ms 344 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 557 ms 452 KB Output is correct
2 Correct 762 ms 348 KB Output is correct

Subtask #9
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5053 ms 1228 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5090 ms 1228 KB Time limit exceeded
2 Halted 0 ms 0 KB -