| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311571 | robijoy | Pyramids (IOI24_pyramids) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> robi1, robi2;
void init(std::vector<int> A, std::vector<int> B) {
robi1[0] = A[0];
for (int i = 1; i < A.size(); ++i) robi1[i] += robi[i-1]+arr[i];
robi2[0] = B[0];
for (int i = 1; i < B.size(); ++i) robi2[i] += robi2[i-1]+arr[i];
}
bool can_transform(int L, int R, int X, int Y) {
ll sum1 = 0, sum2 = 0;
L--;
int x = 0;
if(L!=-1) x = robi1[x];
X--;
int y = 0;
if(X!=-1) y = robi2[y];
sum1 = robi1[R]-x;
sum2 = robi2[R]-y;
return (sum1==sum2);
}
