Submission #3730578


Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define LL long long

using namespace std;
const int maxn = 2e5 + 5;
typedef pair<int, int> P;
int a[maxn];
int n, k, q, ans;
bool check(int o, int p) {
    int ti = 0;
    int x = 0;
    int y = 0;
    for(int i = 0; i <= n; ++i) {
        if(a[i] >= o) {
            if(a[i] <= o + p) {
                x ++;
            } else {
                y ++;
            }
        } else {
            if(y >= k - 1) {
                ti += x;
            } else {
                ti += max(0, x - (k - 1 - y));
            }
            x = 0;
            y = 0;
        }
    }
    return ti >= q;
}
int main() {
#ifdef TT
    freopen("xxx.in", "r", stdin);
#endif // TT
    scanf("%d%d%d", &n, &k, &q);
    for(int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    a[n] = -1;
    ans = 1e9 + 7;
    for(int i = 0; i < n; ++i) {
        int L = 0, R = 1e9 + 7;
        while(L < R) {
            int mid = (L + R) >> 1;
            if(check(a[i], mid))
                R = mid;
            else
                L = mid + 1;
        }
        ans = min(ans, L);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task E - Range Minimum Queries
User vjudge1
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1173 Byte
Status AC
Exec Time 314 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:32: 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:40:27: 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
AC × 3
AC × 54
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 128 ms 256 KB
subtask_1_04.txt AC 2 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 9 ms 256 KB
subtask_1_07.txt AC 153 ms 256 KB
subtask_1_08.txt AC 173 ms 256 KB
subtask_1_09.txt AC 66 ms 256 KB
subtask_1_10.txt AC 48 ms 256 KB
subtask_1_11.txt AC 203 ms 256 KB
subtask_1_12.txt AC 314 ms 256 KB
subtask_1_13.txt AC 210 ms 256 KB
subtask_1_14.txt AC 204 ms 256 KB
subtask_1_15.txt AC 240 ms 256 KB
subtask_1_16.txt AC 202 ms 256 KB
subtask_1_17.txt AC 137 ms 256 KB
subtask_1_18.txt AC 161 ms 256 KB
subtask_1_19.txt AC 157 ms 256 KB
subtask_1_20.txt AC 161 ms 256 KB
subtask_1_21.txt AC 162 ms 256 KB
subtask_1_22.txt AC 136 ms 256 KB
subtask_1_23.txt AC 179 ms 256 KB
subtask_1_24.txt AC 210 ms 256 KB
subtask_1_25.txt AC 159 ms 256 KB
subtask_1_26.txt AC 176 ms 256 KB
subtask_1_27.txt AC 217 ms 256 KB
subtask_1_28.txt AC 168 ms 256 KB
subtask_1_29.txt AC 138 ms 256 KB
subtask_1_30.txt AC 119 ms 256 KB
subtask_1_31.txt AC 204 ms 256 KB
subtask_1_32.txt AC 221 ms 256 KB
subtask_1_33.txt AC 203 ms 256 KB
subtask_1_34.txt AC 202 ms 256 KB
subtask_1_35.txt AC 203 ms 256 KB
subtask_1_36.txt AC 202 ms 384 KB
subtask_1_37.txt AC 140 ms 256 KB
subtask_1_38.txt AC 137 ms 256 KB
subtask_1_39.txt AC 141 ms 256 KB
subtask_1_40.txt AC 136 ms 256 KB
subtask_1_41.txt AC 164 ms 256 KB
subtask_1_42.txt AC 153 ms 256 KB
subtask_1_43.txt AC 158 ms 256 KB
subtask_1_44.txt AC 159 ms 256 KB
subtask_1_45.txt AC 136 ms 256 KB
subtask_1_46.txt AC 119 ms 256 KB
subtask_1_47.txt AC 202 ms 256 KB
subtask_1_48.txt AC 202 ms 256 KB