제출 #1165929

#제출 시각아이디문제언어결과실행 시간메모리
1165929aminabouakazPyramids (IOI24_pyramids)C++20
30 / 100
55 ms5064 KiB
#include <vector>
using namespace std;

vector<int> pyramidsA, pyramidsB;
vector<int> sumA, sumB;

void init(vector<int> A, vector<int> B) {
    pyramidsA = A;
    pyramidsB = B;

    sumA = A;
    sumB = B;
    for (int i = 1; i < A.size(); ++i) {
        sumA[i] += sumA[i - 1];
        sumB[i] += sumB[i - 1];
    }
}

bool can_transform(int L, int R, int X, int Y) {
    return (sumA[R] - (L > 0 ? sumA[L - 1] : 0)) ==
    (sumB[Y] - (X > 0 ? sumB[X - 1] : 0));
}



#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...