# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165496 | 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 can_transform(int L, int R, int X, int Y) {
int sumA = accumulate(pyramidsA.begin() + L, pyramidsA.begin() + R + 1, 0);
int sumB = accumulate(pyramidsB.begin() + X, pyramidsB.begin() + Y + 1, 0);
return sumA == sumB;
}
int main() {
int N, Q;
cin >> N >> Q;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
init(A, B);
for (int i = 0; i < Q; ++i) {
int L, R, X, Y;
cin >> L >> R >> X >> Y;
cout << (can_transform(L, R, X, Y) ? 1 : 0) << endl;
}
return 0;
}