251362026-02-18 08:24:27KoszorusBlankaMI bróker (50 pont)cpp17Wrong answer 0/50593ms636 KiB
#include <bits/stdc++.h>

using namespace std;

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

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

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

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

    for (int i = 1; i <= N; i++)
        cout << ossz[i];

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Runtime error0/0426ms508 KiB
3Wrong answer0/11ms316 KiB
4Wrong answer0/11ms508 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/26ms316 KiB
7Wrong answer0/26ms316 KiB
8Runtime error0/1122ms424 KiB
9Runtime error0/1188ms444 KiB
10Runtime error0/2593ms444 KiB
11Runtime error0/2404ms440 KiB
12Runtime error0/2550ms508 KiB
13Runtime error0/2512ms632 KiB
14Runtime error0/2497ms316 KiB
15Runtime error0/3414ms508 KiB
16Runtime error0/3437ms316 KiB
17Runtime error0/3467ms316 KiB
18Runtime error0/3407ms316 KiB
19Runtime error0/3421ms316 KiB
20Runtime error0/3430ms316 KiB
21Runtime error0/3433ms444 KiB
22Runtime error0/3432ms564 KiB
23Runtime error0/3426ms636 KiB
24Runtime error0/3474ms316 KiB