226142026-01-15 12:21:48ercseferencMI bróker (50 pont)cpp17Accepted 50/50307ms2608 KiB
#include <bits/stdc++.h>
using namespace std;
int a[502][502];
//a legkisebb aki, aki változik
int main()
{
    //ifstream f("szamok.txt");
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,q; cin>>n>>q;
    vector<int>b(n);
    for(int i=0; i<n; i++)cin>>b[i];
    for(int i=1; i<=500; i++){
        int t=501;
        for(int j:b){
            if(j<=i){a[i][t]+=j; t=i+1; a[i][t]-=j;}
            else {a[i][t]+=j; if(t<j+1)t=j+1; a[i][t]-=j;}}
        for(int j=2; j<=500; j++)a[i][j]+=a[i][j-1];}
    for(int i=0; i<q; i++){
        int x,y; cin>>x>>y;
        cout<<a[x][y]<<endl;
        }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/03ms1332 KiB
2Accepted0/0177ms1844 KiB
3Accepted1/12ms1576 KiB
4Accepted1/13ms1332 KiB
5Accepted2/24ms1332 KiB
6Accepted2/232ms1316 KiB
7Accepted2/232ms1276 KiB
8Accepted1/1277ms1924 KiB
9Accepted1/1293ms1844 KiB
10Accepted2/2307ms2608 KiB
11Accepted2/2279ms2100 KiB
12Accepted2/2289ms2356 KiB
13Accepted2/2305ms2356 KiB
14Accepted2/2303ms2248 KiB
15Accepted3/3275ms2352 KiB
16Accepted3/3284ms2356 KiB
17Accepted3/3298ms2432 KiB
18Accepted3/3300ms2436 KiB
19Accepted3/3279ms2356 KiB
20Accepted3/3284ms2344 KiB
21Accepted3/3298ms2408 KiB
22Accepted3/3298ms2356 KiB
23Accepted3/3279ms2356 KiB
24Accepted3/3256ms2432 KiB