| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1165952 | ines | Pyramids (IOI24_pyramids) | C++20 | 0 ms | 0 KiB | 
#include <vector>
using namespace std;
vector<int> pyramidsA, pyramidsB;
void init(vector<int> A, vector<int> B) {
    pyramidsA = A;
    pyramidsB = B;
}
bool can_transform(long long L, long long R, long long X, long long Y) {
    long long sumA = 0, sumB = 0;
    for (long long i = L; i <= R; ++i) {
        sumA += pyramidsA[i];
    }
    for (long long i = X; i <= Y; ++i) {
        sumB += pyramidsB[i];
    }
    if (sumA != sumB) {
        return false;
    }
    else{
    return true;
    }
}
