Submission #1166464

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166464		aminabouakaz	Pyramids (IOI24_pyramids)	C++20	100 / 100	39 ms	4936 KiB

pyramids

#include <iostream>
#include <vector>

using namespace std;

vector<long long> prefixSumsA;
vector<long long> prefixSumsB;

void init(vector<int> a, vector<int> b) {
    int n = a.size();
    prefixSumsA.resize(n + 1, 0);
    prefixSumsB.resize(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        prefixSumsA[i + 1] = prefixSumsA[i] + a[i];
        prefixSumsB[i + 1] = prefixSumsB[i] + b[i];
    }
}

bool can_transform(int l, int r, int x, int y) {
    long long sumA = prefixSumsA[r + 1] - prefixSumsA[l];
    long long sumB = prefixSumsB[y + 1] - prefixSumsB[x];
    return sumA == sumB;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20
• Subtask 4: 30 / 30