Submission #1,869

2022-12-06 19:40:36

cpp17

Wrong answer 24/50

13ms

5004 KiB

#include <bits/stdc++.h>
#define speed ios::sync_with_stdio(0);cin.tie(0)
using namespace std;

int main() {
    speed;
    int n, p;
    cin >> n >> p;
    vector<int> v(n);
    for (auto& a : v) cin >> a;
    int l = 0, r = -1;
    int best = INT_MAX;
    int s = 0;
    while (r < n) {
        while (s >= p) {
            s -= v[l];
            l++;
        }
        while (s < p && r < n) {
            r++;
            s += v[r];
        }
        best = min(best, r - l + 1);
    }
    cout << best;
}

	Sum	Test	Verdict		Time	Memory
base	24/50
		1	Wrong answer	0/0	3ms	1828 KiB
		2	Wrong answer	0/0	13ms	2712 KiB
		3	Accepted	2/2	2ms	2124 KiB
		4	Wrong answer	0/2	2ms	2328 KiB
		5	Accepted	2/2	2ms	2552 KiB
		6	Wrong answer	0/2	3ms	2904 KiB
		7	Accepted	2/2	3ms	3108 KiB
		8	Accepted	2/2	3ms	3052 KiB
		9	Accepted	2/2	3ms	3308 KiB
		10	Accepted	2/2	3ms	3256 KiB
		11	Accepted	2/2	13ms	4036 KiB
		12	Wrong answer	0/2	13ms	4108 KiB
		13	Wrong answer	0/2	13ms	4112 KiB
		14	Wrong answer	0/2	13ms	4188 KiB
		15	Wrong answer	0/2	13ms	4316 KiB
		16	Accepted	2/2	13ms	4592 KiB
		17	Wrong answer	0/2	13ms	4680 KiB
		18	Wrong answer	0/2	13ms	4764 KiB
		19	Wrong answer	0/2	13ms	4828 KiB
		20	Accepted	2/2	13ms	4796 KiB
		21	Accepted	2/2	13ms	4932 KiB
		22	Wrong answer	0/2	13ms	5004 KiB
		23	Accepted	2/2	13ms	4928 KiB
		24	Accepted	2/2	13ms	4924 KiB
		25	Wrong answer	0/2	13ms	4928 KiB
		26	Wrong answer	0/2	13ms	4924 KiB
		27	Wrong answer	0/2	13ms	5000 KiB