152802025-02-18 07:58:09szjMI bróker (50 pont)cpp17Time limit exceeded 4/501.1s1332 KiB
#include <iostream>
using namespace std;
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);
    int n, q, i, j, ar, sum, k;
    bool van;
    cin >> n >> q;
    int a[n], le[501][501];
    for(i=0; i<n; i++)cin >> a[i];
    for(i=0; i<501; i++){
        for(j=0; j<501; j++){
            van = 0;
            sum = 0;
            for(k=0; k<n; k++){
                ar = a[k];
                if(!van && ar<=i){
                    sum-=ar;
                    van = 1;
                }
                else if(van && ar>=j){
                    sum+=ar;
                    van = 0;
                }
            }
            le[i][j] = sum;
        }
    }
    while(q--){
        cin >> i >> j;
        cout << le[i][j] << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base4/50
1Accepted0/04ms1332 KiB
2Time limit exceeded0/01.082s564 KiB
3Accepted1/13ms1332 KiB
4Accepted1/14ms1332 KiB
5Accepted2/2529ms1204 KiB
6Time limit exceeded0/21.1s476 KiB
7Time limit exceeded0/21.1s472 KiB
8Time limit exceeded0/11.078s568 KiB
9Time limit exceeded0/11.088s564 KiB
10Time limit exceeded0/21.088s508 KiB
11Time limit exceeded0/21.088s572 KiB
12Time limit exceeded0/21.085s476 KiB
13Time limit exceeded0/21.09s316 KiB
14Time limit exceeded0/21.082s568 KiB
15Time limit exceeded0/31.082s564 KiB
16Time limit exceeded0/31.074s564 KiB
17Time limit exceeded0/31.082s472 KiB
18Time limit exceeded0/31.083s564 KiB
19Time limit exceeded0/31.085s576 KiB
20Time limit exceeded0/31.077s564 KiB
21Time limit exceeded0/31.092s564 KiB
22Time limit exceeded0/31.082s564 KiB
23Time limit exceeded0/31.082s580 KiB
24Time limit exceeded0/31.09s500 KiB