Submission #3416159


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define N 2010

int n,K,Q,ans=2e9;
int a[N],b[N],c[N];

int main()
{
	scanf("%d%d%d",&n,&K,&Q);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	for (int i=1;i<=n;i++) {
		int tot=0;
		for (int j=1,nex;j<=n;j=nex+1) {
			nex=j; while (a[nex]>=a[i]) nex++;
			if (nex-j>=K) {
				for (int k=j;k<nex;k++) b[k]=a[k];
				sort(b+j,b+nex);
				for (int k=j;k<=nex-j-K+1;k++) c[++tot]=b[k];
			}
		}
		sort(c+1,c+tot+1);
		if (tot>=Q) ans=min(ans,c[Q]-a[i]);
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - Range Minimum Queries
User zhoujundong2002
Language C++14 (GCC 5.4.1)
Score 0
Code Size 556 Byte
Status WA
Exec Time 61 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&K,&Q);
                          ^
./Main.cpp:11:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1;i<=n;i++) scanf("%d",&a[i]);
                                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 3
AC × 41
WA × 13
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt WA 19 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 2 ms 256 KB
subtask_1_07.txt AC 15 ms 256 KB
subtask_1_08.txt AC 18 ms 256 KB
subtask_1_09.txt AC 17 ms 256 KB
subtask_1_10.txt AC 26 ms 256 KB
subtask_1_11.txt WA 24 ms 256 KB
subtask_1_12.txt WA 35 ms 384 KB
subtask_1_13.txt WA 34 ms 256 KB
subtask_1_14.txt AC 21 ms 256 KB
subtask_1_15.txt WA 22 ms 256 KB
subtask_1_16.txt AC 22 ms 256 KB
subtask_1_17.txt AC 41 ms 256 KB
subtask_1_18.txt WA 52 ms 384 KB
subtask_1_19.txt WA 41 ms 256 KB
subtask_1_20.txt AC 34 ms 256 KB
subtask_1_21.txt WA 42 ms 256 KB
subtask_1_22.txt AC 38 ms 256 KB
subtask_1_23.txt WA 16 ms 256 KB
subtask_1_24.txt AC 25 ms 256 KB
subtask_1_25.txt WA 24 ms 256 KB
subtask_1_26.txt WA 12 ms 256 KB
subtask_1_27.txt AC 33 ms 256 KB
subtask_1_28.txt AC 12 ms 256 KB
subtask_1_29.txt AC 35 ms 256 KB
subtask_1_30.txt AC 61 ms 256 KB
subtask_1_31.txt WA 23 ms 256 KB
subtask_1_32.txt WA 22 ms 256 KB
subtask_1_33.txt AC 13 ms 256 KB
subtask_1_34.txt AC 12 ms 256 KB
subtask_1_35.txt AC 13 ms 256 KB
subtask_1_36.txt AC 12 ms 256 KB
subtask_1_37.txt AC 18 ms 256 KB
subtask_1_38.txt AC 4 ms 256 KB
subtask_1_39.txt AC 9 ms 256 KB
subtask_1_40.txt AC 33 ms 256 KB
subtask_1_41.txt AC 6 ms 256 KB
subtask_1_42.txt AC 6 ms 256 KB
subtask_1_43.txt AC 6 ms 256 KB
subtask_1_44.txt AC 6 ms 256 KB
subtask_1_45.txt AC 23 ms 256 KB
subtask_1_46.txt AC 43 ms 256 KB
subtask_1_47.txt AC 12 ms 256 KB
subtask_1_48.txt AC 12 ms 256 KB