| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311491 | jahirsha101 | Pyramids (IOI24_pyramids) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
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];
while(q--){
int l,r,x,y; cin >> l >> r >> x >> y;
int s=0,p=0;
for(int i=l;i<=r;i++) s+=a[i];
for(int i=x;i<=y;i++) p+=b[i];
if(s==p) cout << "true\n";
else cout << "false\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
}
