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