244662026-02-11 21:30:30Pedri26MI bróker (50 pont)cpp17Wrong answer 0/501.1s756 KiB
#include <bits/stdc++.h>

using namespace std;
int n, q, a[10001];

int main() {
    // Gyors I/O
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=q;i++)
    {
        int also, felso;
        long long s=0;
        cin>>felso>>also;
        bool van=false;
        for(int j=1;j<=n;j++)
        {
            if(!van)
            {
                if(a[j]<=felso)
                {
                    s-=a[j];
                    //cout<<"-"<<a[j]<<" ";
                    van=true;
                }
            }
            else
            {
                if(a[j]>=also)
                {
                    s+=a[j];
                    //cout<<"+"<<a[j]<<" ";
                    van=false;
                }
            }
        }
        cout<<s<<"/n";
    }
   

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Time limit exceeded0/01.082s564 KiB
3Wrong answer0/11ms512 KiB
4Wrong answer0/11ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Time limit exceeded0/11.1s716 KiB
9Time limit exceeded0/11.1s464 KiB
10Time limit exceeded0/21.1s568 KiB
11Time limit exceeded0/21.077s692 KiB
12Time limit exceeded0/21.082s756 KiB
13Time limit exceeded0/21.082s536 KiB
14Time limit exceeded0/21.083s564 KiB
15Time limit exceeded0/31.08s564 KiB
16Time limit exceeded0/31.08s568 KiB
17Time limit exceeded0/31.082s572 KiB
18Time limit exceeded0/31.082s568 KiB
19Time limit exceeded0/31.088s564 KiB
20Time limit exceeded0/31.074s748 KiB
21Time limit exceeded0/31.074s568 KiB
22Time limit exceeded0/31.075s436 KiB
23Time limit exceeded0/31.085s564 KiB
24Time limit exceeded0/31.075s564 KiB