Submission #1282260

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282260		MMihalev	Mosaic (IOI24_mosaic)	C++20	7 / 100	74 ms	14536 KiB

mosaic

#include<iostream>
#include<algorithm>
#include<vector>
#include "mosaic.h"
using namespace std;
const int MAX_N=2e5+5;
int a[MAX_N];
int p[MAX_N];
int n,q;
vector<long long>ans;
std::vector<long long> mosaic(std::vector<int> X, std::vector<int> Y,std::vector<int> T, std::vector<int> B,std::vector<int> L, std::vector<int> R)
{
    n=X.size();
    q=T.size();
    ans.resize(q);

    for(int j=1;j<=n;j++)
    {
        a[j]=X[j-1];
        p[j]=p[j-1]+a[j];
    }

    for(int i=1;i<=q;i++)
    {
        ans[i-1]=p[R[i-1]+1]-p[L[i-1]];
    }

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22