| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311565 | robijoy | Pyramids (IOI24_pyramids) | C++20 | 0 ms | 0 KiB |
#include "pyramids.h"
#include <bits/stdc++.h>
vector<int> robi1, robi2;
void init(std::vector<int> A, std::vector<int> B) {
robi1 = A;
robi2 = B;
}
bool can_transform(int L, int R, int X, int Y) {
int sum1 = 0;
for (int i = L; i <= R; ++i) sum1+=robi1[i];
for (int i = X; i <= Y; ++i) sum2+=robi2[i];
return (sum1==sum2);
}
