Submission #73211403

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>
#include <stdlib.h>
int cmp(const void* x, const void* y) {
  int a = *(const int*)x, b = *(const int*)y;
  return (a > b) - (a < b);
}
int d;
int n;
int m;
int dx[114514];
int kx[11234];
int main(void) {
  int i;
  int ans = 0;
  if (scanf("%d", &d) != 1) return 1;
  if (scanf("%d", &n) != 1) return 1;
  if (scanf("%d", &m) != 1) return 1;
  for (i = 1; i < n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <stdlib.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	return (a > b) - (a < b);
}

int d;
int n;
int m;
int dx[114514];
int kx[11234];

int main(void) {
	int i;
	int ans = 0;
	if (scanf("%d", &d) != 1) return 1;
	if (scanf("%d", &n) != 1) return 1;
	if (scanf("%d", &m) != 1) return 1;
	for (i = 1; i < n; i++) {
		if (scanf("%d", &dx[i]) != 1) return 1;
	}
	for (i = 0; i < m; i++) {
		if (scanf("%d", &kx[i]) != 1) return 1;
	}
	qsort(dx, n, sizeof(*dx), cmp);
	dx[n] = d;
	for (i = 0; i < m; i++) {
		int le = 0, g = n;
		int c1, c2;
		while (le + 1 < g) {
			int m = le + (g - le) / 2;
			if (dx[m] <= kx[i]) le = m; else g = m;
		}
		c1 = kx[i] - dx[le];
		c2 = dx[g] - kx[i];
		ans += c1 <= c2 ? c1 : c2;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result