| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1165914 | aminabouakaz | Pyramids (IOI24_pyramids) | C++20 | 34 ms | 4296 KiB |
#include <vector>
#include <numeric>
using namespace std;
vector<int> prefixA, prefixB;
void init(vector<int> A, vector<int> B) {
int N = A.size();
prefixA.resize(N);
prefixB.resize(N);
partial_sum(A.begin(), A.end(), prefixA.begin());
partial_sum(B.begin(), B.end(), prefixB.begin());
}
bool can_transform(int L, int R, int X, int Y) {
int sum_A = prefixA[R] - (L > 0 ? prefixA[L - 1] : 0);
int sum_B = prefixB[Y] - (X > 0 ? prefixB[X - 1] : 0);
if (sum_A != sum_B) {
return false;
}
return true;
}
| # | 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... | ||||
