| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1166215 | sqrteipi | Pyramids (IOI24_pyramids) | C++20 | 33 ms | 4932 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 = 1; i <= n; i++) {
prea[i] = prea[i - 1] + a[i - 1];
preb[i] = preb[i - 1] + b[i - 1];
}
}
bool can_transform(int l, int r, int x, int y) {
return (prea[r] - prea[l - 1]) == (preb[y] - preb[x - 1]);
}| # | 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... | ||||
