#include <bits/stdc++.h>
#include "pyramids.h"
using namespace std;
#define ll long long
vector<ll> prefix1, prefix2;
void init(std::vector<int> A, std::vector<int> B) {
int n = (int) A.size();
prefix1.resize(n+1,0);
prefix2.resize(n+1,0);
for(int i=1;i<=n;++i)
{
prefix1[i] = prefix1[i - 1] + (A[i - 1] * 1LL);
prefix2[i] = prefix2[i - 1] + (B[i - 1] * 1LL);
}
}
bool can_transform(int L, int R, int X, int Y) {
ll sum1 = prefix1[R + 1] - prefix1[L];
ll sum2 = prefix2[R + 1] - prefix2[L];
return sum1 == sum2;
}
# | 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... |