#501994 (C++14) No.1093 区間の和 / Sum of Range

• 問題: No.1093 区間の和 / Sum of Range
• ユーザー: QCFium
• 提出日時: 2020-06-24 22:34:08
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 38 ms / 2,000 ms
• コード長: 1,462 bytes
• コンパイル時間: 1,361 ms
• コンパイル使用メモリ: 166,060 KB
• 実行使用メモリ: 4,504 KB
• 最終ジャッジ日時: 2023-09-16 21:24:52
• 合計ジャッジ時間: 3,837 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	19 ms; 4,380 KB
testcase_02	AC	9 ms; 4,380 KB
testcase_03	AC	12 ms; 4,380 KB
testcase_04	AC	11 ms; 4,380 KB
testcase_05	AC	24 ms; 4,380 KB
testcase_06	AC	8 ms; 4,380 KB
testcase_07	AC	16 ms; 4,384 KB
testcase_08	AC	18 ms; 4,380 KB
testcase_09	AC	21 ms; 4,380 KB
testcase_10	AC	17 ms; 4,380 KB
testcase_11	AC	20 ms; 4,380 KB
testcase_12	AC	16 ms; 4,504 KB
testcase_13	AC	2 ms; 4,376 KB
testcase_14	AC	21 ms; 4,380 KB
testcase_15	AC	9 ms; 4,380 KB
testcase_16	AC	27 ms; 4,376 KB
testcase_17	AC	19 ms; 4,376 KB
testcase_18	AC	15 ms; 4,376 KB
testcase_19	AC	4 ms; 4,376 KB
testcase_20	AC	13 ms; 4,380 KB
testcase_21	AC	26 ms; 4,380 KB
testcase_22	AC	28 ms; 4,376 KB
testcase_23	AC	17 ms; 4,376 KB
testcase_24	AC	12 ms; 4,380 KB
testcase_25	AC	21 ms; 4,380 KB
testcase_26	AC	21 ms; 4,380 KB
testcase_27	AC	22 ms; 4,380 KB
testcase_28	AC	19 ms; 4,380 KB
testcase_29	AC	38 ms; 4,376 KB
testcase_30	AC	5 ms; 4,380 KB
testcase_31	AC	9 ms; 4,376 KB
testcase_32	AC	12 ms; 4,376 KB
testcase_33	AC	29 ms; 4,376 KB
testcase_34	AC	4 ms; 4,380 KB
testcase_35	AC	23 ms; 4,380 KB
testcase_36	AC	26 ms; 4,380 KB

ソースコード

#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

void rsort(int *x, int n) {
	int c[256] = { 0 };
	int *r0 = (int *) malloc(sizeof(int) * n);
	assert(r0);
	for (int i = 0; i < n; i++) c[x[i] & 0x7F]++;
	for (int i = 1; i < 128; i++) c[i] += c[i - 1];
	for (int i = n - 1; i >= 0; i--) r0[--c[x[i] & 0x7F]] = x[i];
	memset(c, 0, sizeof(c));
	for (int i = 0; i < n; i++) c[r0[i] >> 7 & 0xFF]++;
	for (int i = 1; i < 256; i++) c[i] += c[i - 1];
	for (int i = n - 1; i >= 0; i--) x[--c[r0[i] >> 7 & 0xFF]] = r0[i];
	memset(c, 0, sizeof(c));
	for (int i = 0; i < n; i++) c[x[i] >> 15 & 0xFF]++;
	for (int i = 1; i < 256; i++) c[i] += c[i - 1];
	for (int i = n - 1; i >= 0; i--) r0[--c[x[i] >> 15 & 0xFF]] = x[i];
	memset(c, 0, sizeof(c));
	for (int i = 0; i < n; i++) c[r0[i] >> 23 & 0xFF]++;
	for (int i = 1; i < 256; i++) c[i] += c[i - 1];
	for (int i = n - 1; i >= 0; i--) x[--c[r0[i] >> 23 & 0xFF]] = r0[i];
	for (int i = 1; i < n; i++) assert(x[i] >= x[i - 1]);
	free(r0);
}

int main() {
	int n = ri();
	int k = ri();
	int a[n];
	for (auto &i : a) i = ri();
	
	int all[n - k + 1];
	int cur = std::accumulate(a, a + k, 0);
	for (int i = 0; i <= n - k; i++) {
		all[i] = cur + 1000000000;
		cur -= a[i];
		if (i + k < n) cur += a[i + k];
	}
	rsort(all, n - k + 1);
	
	int q = ri();
	for (int i = 0; i < q; i++) {
		 int x = ri();
		 printf("%d\n", (int) (std::upper_bound(all, all + n - k + 1, x + 1000000000) - all));
	}
	return 0;
}