Submission #1271679

#TimeUsernameProblemLanguageResultExecution timeMemory
1271679pxsitMosaic (IOI24_mosaic)C++20
0 / 100
75 ms12176 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<long long> mosaic(vector<int> x, vector<int> y,vector<int> T, vector<int> B,vector<int> L, vector<int> R){
    int n = x.size(), q = T.size();
    vector<long long> ans(q,0);
    if(n == 1){
        for(int i=0;i<q;i++) ans[i] = x[0];
        return ans;
    }
    vector<int> pref(n,0);
    for(int i = 1;i<n;i++) pref[i] = pref[i-1] + x[i];
    for(int qrs=0;qrs<q;qrs++){
        int t = T[qrs],b = B[qrs],l = L[qrs],r = R[qrs];
        if(l == 0){
            ans[qrs] = pref[r];
        }else{
            ans[qrs] = pref[r] - pref[l - 1];
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...