Submission #1775627
Source Code Expand
#include <stdio.h> #include <stdlib.h> #define P 1000000007 int compare_int(const void *a, const void *b) { return *(int*)a - *(int*)b; } int count(int* a, int N){ int ans = 0; for (int i = 0; i < N; i++) { int low_count = 0, count = 0; /*一番低いものの探査*/ for (int j = 0;j < N; j++) { if (a[i] < a[j] * 2) break; else (low_count++ % P); } for (int j = 0;j < N; j++) { if (a[i] * 2 <= a[j]) { for (int k = j; k < N; k++) { if (a[k] >= a[j] * 2) { count += (N - k) % P; break; } } } } ans += (count * low_count) % P; } return ans; } int main(void) { int N; scanf("%d\n", &N); int a[N]; for (int i = 0; i < N; i++){ scanf("%d\n", &a[i]); } qsort(a, N, sizeof(int), compare_int); printf("%d\n", count(a, N)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 難易度 |
User | sifi_border |
Language | C (GCC 5.4.1) |
Score | 0 |
Code Size | 921 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 892 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:36:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n", &N); ^ ./Main.c:39:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n", &a[i]); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 50 | ||||||||||||
Status |
|
|
|
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 | 3 ms | 128 KB |
subtask1_03.txt | WA | 768 ms | 128 KB |
subtask1_04.txt | WA | 402 ms | 128 KB |
subtask1_05.txt | WA | 269 ms | 128 KB |
subtask1_06.txt | WA | 1051 ms | 128 KB |
subtask1_07.txt | WA | 218 ms | 128 KB |
subtask1_08.txt | WA | 702 ms | 128 KB |
subtask1_09.txt | WA | 829 ms | 252 KB |
subtask1_10.txt | WA | 103 ms | 128 KB |
subtask1_11.txt | WA | 590 ms | 128 KB |
subtask1_12.txt | WA | 832 ms | 252 KB |
subtask1_13.txt | WA | 130 ms | 128 KB |
subtask1_14.txt | WA | 287 ms | 128 KB |
subtask1_15.txt | WA | 1126 ms | 252 KB |
subtask1_16.txt | WA | 1131 ms | 252 KB |
subtask1_17.txt | WA | 1142 ms | 128 KB |
subtask1_18.txt | WA | 1121 ms | 252 KB |
subtask1_19.txt | WA | 1118 ms | 252 KB |
subtask2_01.txt | TLE | 2103 ms | 380 KB |
subtask2_02.txt | TLE | 2103 ms | 380 KB |
subtask2_03.txt | TLE | 2103 ms | 256 KB |
subtask2_04.txt | TLE | 2103 ms | 256 KB |
subtask2_05.txt | TLE | 2103 ms | 764 KB |
subtask2_06.txt | TLE | 2103 ms | 764 KB |
subtask2_07.txt | TLE | 2103 ms | 252 KB |
subtask2_08.txt | TLE | 2103 ms | 252 KB |
subtask2_09.txt | TLE | 2103 ms | 764 KB |
subtask2_10.txt | TLE | 2103 ms | 508 KB |
subtask2_11.txt | TLE | 2103 ms | 252 KB |
subtask2_12.txt | TLE | 2103 ms | 508 KB |
subtask2_13.txt | TLE | 2103 ms | 256 KB |
subtask2_14.txt | TLE | 2103 ms | 636 KB |
subtask2_15.txt | TLE | 2103 ms | 892 KB |
subtask2_16.txt | TLE | 2103 ms | 892 KB |
subtask2_17.txt | TLE | 2103 ms | 892 KB |
subtask2_18.txt | TLE | 2103 ms | 892 KB |
subtask2_19.txt | TLE | 2103 ms | 892 KB |
subtask2_20.txt | TLE | 2103 ms | 764 KB |
subtask2_21.txt | TLE | 2103 ms | 764 KB |