Submission #2196689


Source Code Expand

#include <queue>
#include <cstdio>
using namespace std;
int N, L, pt, t, x, bit[131088]; long long d; priority_queue<pair<int, int> > que;
void add(int pos, int val) {
	for (int i = pos + 1; i <= 1 << 17; i += i & (-i)) bit[i] += val;
}
int sum(int pos) {
	int ret = 0;
	for (int i = pos; i >= 1; i -= i & (-i)) ret += bit[i];
	return ret;
}
int bs(int val) {
	int ret = 0;
	for (int i = 16; i >= 0; i--) {
		if (bit[ret + (1 << i)] < val) ret += 1 << i, val -= bit[ret];
	}
	return ret;
}
void push(int z) {
	int ptr = bs(z);
	while (!que.empty()) {
		pair<int, int> u = que.top();
		if (u.first >= ptr) add(u.first, -u.second), que.pop();
		else break;
	}
	int rem = z - sum(ptr);
	if (rem != 0) {
		add(ptr, rem);
		que.push(make_pair(ptr, rem));
	}
}
int main() {
	scanf("%d %d", &N, &L);
	for (int i = 0; i < N; i++) {
		scanf("%d %d", &t, &x);
		if (t != pt) {
			push(i);
			pt = t;
		}
		add(x, 2);
		que.push(make_pair(x, 2));
		d += x;
	}
	push(N);
	for (int i = 0; i < 100000; i++) d += sum(i + 1) - N;
	printf("%lld\n", d);
	return 0;
}

Submission Info

Submission Time
Task E - 花火
User square1001
Language C++14 (GCC 5.4.1)
Score 160
Code Size 1096 Byte
Status AC
Exec Time 50 ms
Memory 1656 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &L);
                        ^
./Main.cpp:36:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t, &x);
                         ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 130 / 130
Status
AC × 3
AC × 45
AC × 95
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt, subtask2_33.txt, subtask2_34.txt, subtask2_35.txt, subtask2_36.txt, subtask2_37.txt, subtask2_38.txt, subtask2_39.txt, subtask2_40.txt, subtask2_41.txt, subtask2_42.txt, subtask2_43.txt, subtask2_44.txt, subtask2_45.txt, subtask2_46.txt, subtask2_47.txt, subtask2_48.txt, subtask2_49.txt, subtask2_50.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 256 KB
sample_02.txt AC 2 ms 256 KB
sample_03.txt AC 2 ms 256 KB
subtask1_01.txt AC 3 ms 256 KB
subtask1_02.txt AC 3 ms 256 KB
subtask1_03.txt AC 3 ms 256 KB
subtask1_04.txt AC 3 ms 256 KB
subtask1_05.txt AC 2 ms 256 KB
subtask1_06.txt AC 3 ms 256 KB
subtask1_07.txt AC 3 ms 256 KB
subtask1_08.txt AC 3 ms 256 KB
subtask1_09.txt AC 2 ms 256 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt AC 2 ms 256 KB
subtask1_12.txt AC 2 ms 256 KB
subtask1_13.txt AC 2 ms 256 KB
subtask1_14.txt AC 2 ms 256 KB
subtask1_15.txt AC 2 ms 256 KB
subtask1_16.txt AC 2 ms 256 KB
subtask1_17.txt AC 3 ms 256 KB
subtask1_18.txt AC 3 ms 256 KB
subtask1_19.txt AC 3 ms 256 KB
subtask1_20.txt AC 3 ms 256 KB
subtask1_21.txt AC 2 ms 256 KB
subtask1_22.txt AC 2 ms 256 KB
subtask1_23.txt AC 2 ms 256 KB
subtask1_24.txt AC 3 ms 256 KB
subtask1_25.txt AC 3 ms 256 KB
subtask1_26.txt AC 3 ms 256 KB
subtask1_27.txt AC 3 ms 256 KB
subtask1_28.txt AC 2 ms 256 KB
subtask1_29.txt AC 2 ms 256 KB
subtask1_30.txt AC 3 ms 256 KB
subtask1_31.txt AC 3 ms 256 KB
subtask1_32.txt AC 3 ms 256 KB
subtask1_33.txt AC 2 ms 256 KB
subtask1_34.txt AC 2 ms 256 KB
subtask1_35.txt AC 2 ms 256 KB
subtask1_36.txt AC 2 ms 256 KB
subtask1_37.txt AC 2 ms 256 KB
subtask1_38.txt AC 2 ms 256 KB
subtask1_39.txt AC 2 ms 256 KB
subtask1_40.txt AC 2 ms 256 KB
subtask1_41.txt AC 2 ms 256 KB
subtask1_42.txt AC 2 ms 256 KB
subtask2_01.txt AC 43 ms 1276 KB
subtask2_02.txt AC 43 ms 1276 KB
subtask2_03.txt AC 43 ms 1276 KB
subtask2_04.txt AC 43 ms 1276 KB
subtask2_05.txt AC 43 ms 1276 KB
subtask2_06.txt AC 34 ms 1148 KB
subtask2_07.txt AC 24 ms 896 KB
subtask2_08.txt AC 15 ms 768 KB
subtask2_09.txt AC 45 ms 892 KB
subtask2_10.txt AC 43 ms 892 KB
subtask2_11.txt AC 44 ms 892 KB
subtask2_12.txt AC 42 ms 892 KB
subtask2_13.txt AC 42 ms 892 KB
subtask2_14.txt AC 26 ms 1656 KB
subtask2_15.txt AC 25 ms 1276 KB
subtask2_16.txt AC 25 ms 1276 KB
subtask2_17.txt AC 25 ms 1276 KB
subtask2_18.txt AC 30 ms 1276 KB
subtask2_19.txt AC 26 ms 1400 KB
subtask2_20.txt AC 26 ms 892 KB
subtask2_21.txt AC 26 ms 892 KB
subtask2_22.txt AC 26 ms 892 KB
subtask2_23.txt AC 27 ms 892 KB
subtask2_24.txt AC 39 ms 1148 KB
subtask2_25.txt AC 40 ms 1148 KB
subtask2_26.txt AC 40 ms 1148 KB
subtask2_27.txt AC 40 ms 1148 KB
subtask2_28.txt AC 42 ms 1148 KB
subtask2_29.txt AC 26 ms 1020 KB
subtask2_30.txt AC 27 ms 1148 KB
subtask2_31.txt AC 26 ms 1148 KB
subtask2_32.txt AC 39 ms 1276 KB
subtask2_33.txt AC 41 ms 1148 KB
subtask2_34.txt AC 26 ms 1148 KB
subtask2_35.txt AC 42 ms 640 KB
subtask2_36.txt AC 42 ms 892 KB
subtask2_37.txt AC 41 ms 892 KB
subtask2_38.txt AC 43 ms 1656 KB
subtask2_39.txt AC 26 ms 1656 KB
subtask2_40.txt AC 32 ms 1400 KB
subtask2_41.txt AC 33 ms 256 KB
subtask2_42.txt AC 50 ms 892 KB
subtask2_43.txt AC 43 ms 1148 KB
subtask2_44.txt AC 28 ms 1656 KB
subtask2_45.txt AC 41 ms 892 KB
subtask2_46.txt AC 31 ms 1400 KB
subtask2_47.txt AC 32 ms 256 KB
subtask2_48.txt AC 2 ms 256 KB
subtask2_49.txt AC 2 ms 256 KB
subtask2_50.txt AC 2 ms 256 KB