| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1165932 | aminabouakaz | Pyramids (IOI24_pyramids) | C++20 | 33 ms | 5064 KiB |
#include <vector>
using namespace std;
vector<int> pyramidsA, pyramidsB;
vector<int> sumA, sumB;
void init(vector<int> A, vector<int> B) {
pyramidsA = A;
pyramidsB = B;
sumA = A;
sumB = B;
for (int i = 1; i < A.size(); ++i) {
sumA[i] += sumA[i - 1];
sumB[i] += sumB[i - 1];
}
}
bool can_transform(int L, int R, int X, int Y) {
int sum_A = sumA[R] - (L > 0 ? sumA[L - 1] : 0);
int sum_B = sumB[Y] - (X > 0 ? sumB[X - 1] : 0);
return sum_A == sum_B;
}
| # | 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... | ||||
