| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1166219 | sqrteipi | Pyramids (IOI24_pyramids) | C++20 | 61 ms | 5052 KiB |
#include <bits/stdc++.h>
#include "pyramids.h"
using namespace std;
typedef long long ll;
ll prea[100005], preb[100005];
void init(vector<int> a, vector<int> b) {
int n = a.size();
for (int i = 0; i < n; i++) {
prea[i + 1] = prea[i] + a[i];
preb[i + 1] = preb[i] + b[i];
}
}
bool can_transform(int l, int r, int x, int y) {
return (prea[r + 1] - prea[l]) == (preb[y + 1] - preb[x]);
}| # | 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... | ||||
