提出 #77523669

ソースコード 拡げる

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 <inttypes.h>
#define N_MAX 212345
#define TIME_MAX 1123456
int N, D;
int S[N_MAX], T[N_MAX];
int candidates[TIME_MAX];
int main(void) {
  int i;
  uint64_t ans = 0;
  if (scanf("%d%d", &N, &D) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d%d", &S[i], &T[i]) != 2) return 1;
    if (S[i] + D <= T[i]) {
      candidates[S[i]]++;
      candidates[T[i] - D + 1]--;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <inttypes.h>

#define N_MAX 212345
#define TIME_MAX 1123456

int N, D;
int S[N_MAX], T[N_MAX];

int candidates[TIME_MAX];

int main(void) {
	int i;
	uint64_t ans = 0;
	if (scanf("%d%d", &N, &D) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d%d", &S[i], &T[i]) != 2) return 1;
		if (S[i] + D <= T[i]) {
			candidates[S[i]]++;
			candidates[T[i] - D + 1]--;
		}
	}
	for (i = 1; i < TIME_MAX; i++) {
		candidates[i] += candidates[i - 1];
	}
	for (i = 0; i < TIME_MAX; i++) {
		ans += (uint64_t)candidates[i] * (candidates[i] - 1) / 2;
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

/*

「それぞれの人が犯行開始できる時刻」をいもす

*/

提出情報

ジャッジ結果