Submission #1293060


Source Code Expand

#include <cstdio>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
const int mod = 1000000007;
int n, a[100009], dp[5][100009];
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", &a[i]), dp[0][i] = 1;
	sort(a, a + n);
	for (int i = 1; i < 4; i++) {
		int l = 0, sum = 0;
		for (int j = 0; j < n; j++) {
			while (l < n && a[l] * 2 <= a[j]) {
				sum += dp[i - 1][l++];
				if (sum >= mod) sum -= mod;
			}
			dp[i][j] = sum;
		}
	}
	int ret = 0;
	for (int i = 0; i < n; i++) {
		ret += dp[3][i];
		if (ret >= mod) ret -= mod;
	}
	printf("%d\n", ret);
	return 0;
}

Submission Info

Submission Time
Task B - 難易度
User square1001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 636 Byte
Status AC
Exec Time 19 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:9:62: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < n; i++) scanf("%d", &a[i]), dp[0][i] = 1;
                                                              ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 22
AC × 43
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
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, 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
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt AC 1 ms 256 KB
subtask2_01.txt AC 6 ms 768 KB
subtask2_02.txt AC 5 ms 640 KB
subtask2_03.txt AC 3 ms 384 KB
subtask2_04.txt AC 3 ms 512 KB
subtask2_05.txt AC 15 ms 1664 KB
subtask2_06.txt AC 13 ms 1536 KB
subtask2_07.txt AC 1 ms 256 KB
subtask2_08.txt AC 1 ms 256 KB
subtask2_09.txt AC 15 ms 1792 KB
subtask2_10.txt AC 9 ms 1152 KB
subtask2_11.txt AC 1 ms 256 KB
subtask2_12.txt AC 9 ms 1024 KB
subtask2_13.txt AC 2 ms 256 KB
subtask2_14.txt AC 11 ms 1408 KB
subtask2_15.txt AC 19 ms 2176 KB
subtask2_16.txt AC 19 ms 2176 KB
subtask2_17.txt AC 19 ms 2176 KB
subtask2_18.txt AC 19 ms 2176 KB
subtask2_19.txt AC 18 ms 2176 KB
subtask2_20.txt AC 10 ms 2176 KB
subtask2_21.txt AC 10 ms 2176 KB