| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1261534 | software1146 | Pyramids (IOI24_pyramids) | C++17 | 43 ms | 5040 KiB |
#include "pyramids.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> prefixA, prefixB;
void init(vector<int> A, vector<int> B) {
ll N = A.size();
prefixA.resize(N + 1, 0);
prefixB.resize(N + 1, 0);
for (ll i = 0; i < N; ++i) {
prefixA[i + 1] = prefixA[i] + A[i];
prefixB[i + 1] = prefixB[i] + B[i];
}
}
bool can_transform(int L, int R, int X, int Y) {
ll sumA = (prefixA[R + 1] - prefixA[L]);
ll sumB = (prefixB[Y + 1] - prefixB[X]);
if (sumA == sumB) {
return true;
}
else {
return false;
}
}
| # | 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... | ||||
