| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1165964 | ines | Pyramids (IOI24_pyramids) | C++20 | 1096 ms | 4168 KiB |
#include <vector>
#include<numeric>
using namespace std;
vector<int> pyramidsA, pyramidsB;
void init(vector<int> A, vector<int> B) {
pyramidsA = A;
pyramidsB = B;
}
bool can_transform(int L, int R, int X, int Y) {
long long sumA=accumulate(pyramidsA.begin()+L,pyramidsA.begin()+R+1,0LL);
long long sumB=accumulate(pyramidsB.begin()+X,pyramidsB.begin()+Y+1,0LL);
if (sumA != sumB) {
return false;
}
else{
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... | ||||
