Submission #471341


Source Code Expand

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

void q_sort(int [],int size);
int q_sort_func(const void*,const void*);

int main(){
	int N;
	int D[100000];
	int i, j, k, l;
	long count = 0;
	int ans;

	scanf("%d", &N);
	for (i = 0; i < N; i++){
		scanf("%d", &D[i]);
	}

	q_sort(D,N);

	for (i = 0; i < N; i++)
	{
		for (j = i+1; j < N; j++)
		{
			if (D[i] * 2 <= D[j])
			{
				for (k = j+1; k < N; k++)
				{
					if (D[j] * 2 <= D[k])
					{
						for (l = k+1; l < N; l++)
						{
							if (D[k] * 2 <= D[l]){
								count++;
							}
						}
					}
				}
			}
		}
	}
	ans = (int)count % 1000000007;

	printf("%d\n", (int)count);


	return 0;
}


void q_sort(int array[], int size){
	qsort((void *)array, size, sizeof(array[0]), q_sort_func);
}

int q_sort_func(const void* a, const void* b){
	if (*(int *)a < *(int *)b) {//昇順ソート (降順ソートなら不等号を逆に)
		return -1;
	}
	else
		if (*(int *)a == *(int *)b) {
			return 0;
		}
	return 1;
}

Submission Info

Submission Time
Task B - 難易度
User watanuki4_1
Language C (GCC 4.9.2)
Score 0
Code Size 1032 Byte
Status TLE
Exec Time 2036 ms
Memory 1448 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:14:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ^
./Main.c:16:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &D[i]);
   ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 50 0 / 50
Status
AC × 3
AC × 5
TLE × 17
AC × 5
TLE × 38
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 22 ms 796 KiB
sample_02.txt AC 23 ms 796 KiB
sample_03.txt AC 23 ms 800 KiB
subtask1_01.txt AC 22 ms 692 KiB
subtask1_02.txt AC 173 ms 796 KiB
subtask1_03.txt TLE 2033 ms 796 KiB
subtask1_04.txt TLE 2033 ms 800 KiB
subtask1_05.txt TLE 2034 ms 800 KiB
subtask1_06.txt TLE 2034 ms 808 KiB
subtask1_07.txt TLE 2034 ms 808 KiB
subtask1_08.txt TLE 2034 ms 796 KiB
subtask1_09.txt TLE 2034 ms 800 KiB
subtask1_10.txt TLE 2033 ms 800 KiB
subtask1_11.txt TLE 2034 ms 796 KiB
subtask1_12.txt TLE 2033 ms 800 KiB
subtask1_13.txt TLE 2033 ms 800 KiB
subtask1_14.txt TLE 2034 ms 796 KiB
subtask1_15.txt TLE 2034 ms 796 KiB
subtask1_16.txt TLE 2036 ms 796 KiB
subtask1_17.txt TLE 2034 ms 796 KiB
subtask1_18.txt TLE 2033 ms 796 KiB
subtask1_19.txt TLE 2033 ms 800 KiB
subtask2_01.txt TLE 2034 ms 1048 KiB
subtask2_02.txt TLE 2034 ms 932 KiB
subtask2_03.txt TLE 2034 ms 924 KiB
subtask2_04.txt TLE 2033 ms 924 KiB
subtask2_05.txt TLE 2034 ms 1304 KiB
subtask2_06.txt TLE 2035 ms 1236 KiB
subtask2_07.txt TLE 2035 ms 776 KiB
subtask2_08.txt TLE 2034 ms 804 KiB
subtask2_09.txt TLE 2034 ms 1300 KiB
subtask2_10.txt TLE 2034 ms 1056 KiB
subtask2_11.txt TLE 2034 ms 792 KiB
subtask2_12.txt TLE 2032 ms 1044 KiB
subtask2_13.txt TLE 2034 ms 800 KiB
subtask2_14.txt TLE 2035 ms 1168 KiB
subtask2_15.txt TLE 2033 ms 1436 KiB
subtask2_16.txt TLE 2035 ms 1440 KiB
subtask2_17.txt TLE 2034 ms 1448 KiB
subtask2_18.txt TLE 2034 ms 1436 KiB
subtask2_19.txt TLE 2034 ms 1432 KiB
subtask2_20.txt TLE 2034 ms 1180 KiB
subtask2_21.txt TLE 2034 ms 1304 KiB