# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165492 | aminabouakaz | Pyramids (IOI24_pyramids) | C++20 | 0 ms | 0 KiB |
#include <vector>
#include <numeric>
#include <iostream>
using namespace std;
vector<int> pyramidsA, pyramidsB;
void init(vector<int> A, vector<int> B) {
pyramidsA = A;
pyramidsB = B;
}
bool canTransform(int leftA, int rightA, int leftB, int rightB) {
int sumA = accumulate(pyramidsA.begin() + leftA, pyramidsA.begin() + rightA + 1, 0);
int sumB = accumulate(pyramidsB.begin() + leftB, pyramidsB.begin() + rightB + 1, 0);
return sumA == sumB;
}
int main() {
int numPyramids, numQueries;
cin >> numPyramids >> numQueries;
vector<int> stonesA(numPyramids), stonesB(numPyramids);
for (int i = 0; i < numPyramids; ++i) {
cin >> stonesA[i];
}
for (int i = 0; i < numPyramids; ++i) {
cin >> stonesB[i];
}
init(stonesA, stonesB);
for (int i = 0; i < numQueries; ++i) {
int L, R, X, Y;
cin >> L >> R >> X >> Y;
cout << (canTransform(L, R, X, Y) ? 1 : 0) << endl;
}
return 0;
}