/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 0ms 392.0 KiB
#2 Accepted 9ms 428.0 KiB
#3 Accepted 23ms 424.0 KiB
#4 Accepted 20ms 284.0 KiB
#5 Accepted 14ms 324.0 KiB
#6 Accepted 15ms 816.0 KiB
#7 Accepted 16ms 1.172 MiB
#8 Accepted 16ms 1.02 MiB
#9 Accepted 5ms 324.0 KiB

Code

#include <stdio.h>

int main() {
    int t; scanf("%d", &t);
    while (t--) {
        int n, k, d, i, sum = 0, best = -1, lu = -1;
        scanf("%d %d %d", &n, &k, &d);
        int a[n];
        for (i = 0; i < n; i++) scanf("%d", &a[i]);

        for (i = 0; i < k; i++) sum += a[i];
        if (sum % d == 0) best = (sum == k), lu = 0;

        for (i = k; i < n; i++) {
            sum += a[i] - a[i - k];
            if (sum % d == 0 && ((sum == k && best < 1) || (best == -1)))
                best = (sum == k), lu = i - k + 1;
        }

        printf("%d\n", lu == -1 ? -1 : lu + 1);
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1190 Segment Strength
Contest
Brain Booster #9
Language
C99 (GCC 13.2.0)
Submit At
2025-04-06 17:00:13
Judged At
2025-04-06 17:00:13
Judged By
Score
100
Total Time
23ms
Peak Memory
1.172 MiB