Submission #3024602
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> #include<functional> #include<vector> #include<queue> #include<stack> #include<set> using namespace std; #define MOD 1000000007 #define f(i,n) for(int i=0;i<int(n);i++) #define N 2000 int main(){ int a[N]; vector<int>v; vector<int>b; vector<int>d; int n, k, q; int x, y; int ans; bool c; ans = 1000000000; scanf("%d %d %d", &n, &k, &q); f(i, n){ scanf("%d", &a[i]); v.push_back(a[i]); } sort(v.begin(), v.end()); f(ii, n){ if (ii == 0)c = true; else if (v[ii] != v[ii - 1])c = true; else c = false; if (c){ b.clear(); x = 0; y = 0; f(i, n){ if (a[i] >= v[ii])x++; else { sort(d.begin(), d.end()); f(j, x - k + 1)b.push_back(d[j]); x = 0; d.clear(); } if (x == k){ for (int j = (i - k + 1); j < (i + 1); j++)d.push_back(a[j]); } else if (x > k){ d.push_back(a[i]); } } sort(d.begin(), d.end()); f(j, x - k + 1)b.push_back(d[j]); d.clear(); sort(b.begin(), b.end()); if (b.size() < q)break; else{ ans = min(ans, b[q - 1] - b[0]); } } } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Range Minimum Queries |
User | MPL |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 1257 Byte |
Status | AC |
Exec Time | 83 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:27:31: 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:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
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 | AC | 33 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 | 1 ms | 256 KB |
subtask_1_07.txt | AC | 23 ms | 256 KB |
subtask_1_08.txt | AC | 2 ms | 256 KB |
subtask_1_09.txt | AC | 13 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 7 ms | 256 KB |
subtask_1_12.txt | AC | 83 ms | 256 KB |
subtask_1_13.txt | AC | 32 ms | 256 KB |
subtask_1_14.txt | AC | 6 ms | 256 KB |
subtask_1_15.txt | AC | 19 ms | 256 KB |
subtask_1_16.txt | AC | 2 ms | 256 KB |
subtask_1_17.txt | AC | 19 ms | 256 KB |
subtask_1_18.txt | AC | 82 ms | 256 KB |
subtask_1_19.txt | AC | 81 ms | 256 KB |
subtask_1_20.txt | AC | 55 ms | 256 KB |
subtask_1_21.txt | AC | 68 ms | 256 KB |
subtask_1_22.txt | AC | 1 ms | 256 KB |
subtask_1_23.txt | AC | 15 ms | 256 KB |
subtask_1_24.txt | AC | 29 ms | 256 KB |
subtask_1_25.txt | AC | 8 ms | 256 KB |
subtask_1_26.txt | AC | 8 ms | 256 KB |
subtask_1_27.txt | AC | 2 ms | 256 KB |
subtask_1_28.txt | AC | 2 ms | 256 KB |
subtask_1_29.txt | AC | 23 ms | 256 KB |
subtask_1_30.txt | AC | 1 ms | 256 KB |
subtask_1_31.txt | AC | 7 ms | 256 KB |
subtask_1_32.txt | AC | 16 ms | 256 KB |
subtask_1_33.txt | AC | 2 ms | 256 KB |
subtask_1_34.txt | AC | 1 ms | 256 KB |
subtask_1_35.txt | AC | 3 ms | 256 KB |
subtask_1_36.txt | AC | 2 ms | 256 KB |
subtask_1_37.txt | AC | 13 ms | 256 KB |
subtask_1_38.txt | AC | 1 ms | 256 KB |
subtask_1_39.txt | AC | 8 ms | 256 KB |
subtask_1_40.txt | AC | 1 ms | 256 KB |
subtask_1_41.txt | AC | 1 ms | 256 KB |
subtask_1_42.txt | AC | 1 ms | 256 KB |
subtask_1_43.txt | AC | 1 ms | 256 KB |
subtask_1_44.txt | AC | 1 ms | 256 KB |
subtask_1_45.txt | AC | 4 ms | 256 KB |
subtask_1_46.txt | AC | 1 ms | 256 KB |
subtask_1_47.txt | AC | 1 ms | 256 KB |
subtask_1_48.txt | AC | 1 ms | 256 KB |