Submission #69581443

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>
#include <inttypes.h>
int qcnt = 0;
struct elem_s {
  int64_t t;
  int id;
} q[312345 * 2];
void qadjust(int node) {
  for (;;) {
    int minidx = node;
    int i;
    for (i = 1; i <= 2; i++) {
      int c = node * 2 + i;
      if (c < qcnt && q[c].t < q[minidx].t) minidx = c;
    }
    if (minidx == node) {
      if (node == 0) return;
      node = (node - 1) / 2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int qcnt = 0;
struct elem_s {
	int64_t t;
	int id;
} q[312345 * 2];

void qadjust(int node) {
	for (;;) {
		int minidx = node;
		int i;
		for (i = 1; i <= 2; i++) {
			int c = node * 2 + i;
			if (c < qcnt && q[c].t < q[minidx].t) minidx = c;
		}
		if (minidx == node) {
			if (node == 0) return;
			node = (node - 1) / 2;
		} else {
			struct elem_s temp = q[node];
			q[node] = q[minidx];
			q[minidx] = temp;
			node = minidx;
		}
	}
}

void qadd(int64_t t, int id) {
	q[qcnt++] = (struct elem_s){ t, id };
	qadjust(qcnt - 1);
}

struct elem_s qget(void) {
	struct elem_s res;
	if (qcnt <= 0) exit(42);
	res = q[0];
	if (--qcnt > 0) {
		q[0] = q[qcnt];
		qadjust(0);
	}
	return res;
}

int N, K;
int A[312345], B[312345], C[312345];

int matigyouretu[312345];

int64_t ans[312345];

int main(void) {
	int i;
	int ms = 0, me = 0;
	int ninnzuu = 0;
	if (scanf("%d%d", &N, &K) != 2) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d%d%d", &A[i], &B[i], &C[i]) != 3) return 1;
		qadd(A[i], i);
	}
	while (qcnt > 0) {
		struct elem_s cur = qget();
		if (cur.id > 0) {
			matigyouretu[me++] = cur.id;
		} else {
			ninnzuu -= C[-cur.id];
		}
		while (ms < me && ninnzuu + C[matigyouretu[ms]] <= K) {
			ans[matigyouretu[ms]] = cur.t;
			qadd(cur.t + B[matigyouretu[ms]], -matigyouretu[ms]);
			ninnzuu += C[matigyouretu[ms]];
			ms++;
		}
	}
	for (i = 1; i <= N; i++) {
		printf("%" PRId64 "\n", ans[i]);
	}
	return 0;
}

Submission Info

Judge Result