251332026-02-18 08:20:33KoszorusBlankaMI bróker (50 pont)cpp11Wrong answer 0/501.1s644 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N, Q;
    cin >> N >> Q;

    int a[10001];
    for (int i = 1; i <= N; i++)
        cin >> a[i];

    for (int i = 1; i <= Q; i++) {
        int V, E;
        cin >> V >> E;
        int ossz = 0;
        bool van = false;

        for (int j = 1; j <= N; j++) {
            if (!van && a[j] <= V) {
                van = true;
                ossz -= a[j];
            }else if (van && a[j] >= E) {
                van = false;
                ossz += a[j];
            }
        }

        cout << ossz;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Time limit exceeded0/01.077s564 KiB
3Wrong answer0/11ms316 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Time limit exceeded0/11.098s444 KiB
9Time limit exceeded0/11.1s316 KiB
10Time limit exceeded0/21.098s440 KiB
11Time limit exceeded0/21.08s316 KiB
12Time limit exceeded0/21.085s596 KiB
13Time limit exceeded0/21.088s404 KiB
14Time limit exceeded0/21.088s440 KiB
15Time limit exceeded0/31.08s448 KiB
16Time limit exceeded0/31.082s636 KiB
17Time limit exceeded0/31.083s564 KiB
18Time limit exceeded0/31.085s448 KiB
19Time limit exceeded0/31.08s564 KiB
20Time limit exceeded0/31.077s500 KiB
21Time limit exceeded0/31.077s536 KiB
22Time limit exceeded0/31.078s564 KiB
23Time limit exceeded0/31.082s520 KiB
24Time limit exceeded0/31.077s644 KiB