Submission #69773125

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 <inttypes.h>
int64_t N;
int M, K;
int a[114514], b[114514];
int main(void) {
  int i;
  int64_t ans = 0;
  int64_t cur_sekisetu = 0;
  if (scanf("%" SCNd64 "%d%d", &N, &M, &K) != 3) return 1;
  for (i = 1; i <= M; i++) {
    if (scanf("%d%d", &a[i], &b[i]) != 2) return 1;
  }
  a[M + 1] = N + 1;
  b[M + 1] = 0;
  for (i = 1; i <= M + 1; i++) {
    int64_t keika_days = a[i] - a[i - 1];
    if (cur_sekisetu > K) {
      int64_t tikatetu_days = cur_sekisetu - K;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int64_t N;
int M, K;
int a[114514], b[114514];

int main(void) {
	int i;
	int64_t ans = 0;
	int64_t cur_sekisetu = 0;
	if (scanf("%" SCNd64 "%d%d", &N, &M, &K) != 3) return 1;
	for (i = 1; i <= M; i++) {
		if (scanf("%d%d", &a[i], &b[i]) != 2) return 1;
	}
	a[M + 1] = N + 1;
	b[M + 1] = 0;
	for (i = 1; i <= M + 1; i++) {
		int64_t keika_days = a[i] - a[i - 1];
		if (cur_sekisetu > K) {
			int64_t tikatetu_days = cur_sekisetu - K;
			if (tikatetu_days <= keika_days) {
				ans += tikatetu_days;
			} else {
				ans += keika_days;
			}
		}
		cur_sekisetu -= keika_days;
		if (cur_sekisetu < 0) cur_sekisetu = 0;
		cur_sekisetu += b[i];
	}
	printf("%" PRId64 "\n", ans);
	return 0;
}

Submission Info

Judge Result