#include <bits/stdc++.h>
#include "pyramids.h"
using namespace std;
typedef long long ll;
ll prea[100005], preb[100005];
void init(vector<int> a, vector<int> b) {
int n = a.size();
for (int i = 1; i <= n; i++) {
prea[i] = prea[i - 1] + a[i];
preb[i] = preb[i - 1] + b[i];
}
}
bool can_transform(int l, int r, int x, int y) {
return (prea[r] - prea[l - 1]) == (preb[y] - preb[x - 1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |