Submission #34223814

---

Source Code Expand

#include"bits/stdc++.h"

using namespace std;


int main() {
    // freopen("B.in" , "r" , stdin);
    // freopen("B.out" , "w" , stdout);
    int n;
    long long p, q, r;
    cin >> n >> p >> q >> r;
    vector<long long> a(n+1, 0);
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) a[i] += a[i-1];
    // for (int i = 1; i <= n; ++i) cout << a[i] << " ";
    // cout << endl;
    int x = 1, y = 2, z = 3, w = 4;
    int flag = 0;
    while (w <= n+1) {
        // cout << x << " " << y << " " << z << " " << w << endl;
        while (y <= n-1 && a[y-1]-a[x-1] < p) {
            y++;
        }
        while (y <= n-1 && a[y-1]-a[x-1] > p) {
            x++;
        }
        z = max(z, y+1);
        w = max(w, z+1);

        // cout << "!" << x << " " << y << " " << z << " " << w << endl;
        if (a[y-1]-a[x-1] != p) {
            continue;
        }
        while (z <= n && a[z-1]-a[y-1] < q) {
            z++;
        }
        w = max(w, z+1);

        // cout << "!" << x << " " << y << " " << z << " " << w << endl;
        if (a[z-1]-a[y-1] != q) {
            y++;
            continue;
        }
        while (w <= n && a[w-1]-a[z-1] < r) {
            w++;
        }

        // cout << "!" << x << " " << y << " " << z << " " << w << endl;
        if (a[w-1]-a[z-1] != r) {
            z++;
            continue;
        }
        flag = 1;
        break;
    }
    if (flag) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    return 0;
}

Submission Info

Judge Result