Submission #1127840

#	Time	Username	Problem	Language	Result	Execution time	Memory
1127840		totoro	Pyramids (IOI24_pyramids)	C++20	100 / 100	76 ms	5064 KiB

pyramids

#include "pyramids.h"

#include <cassert>

std::vector<long long> preA, preB;

void init(std::vector<int> A, std::vector<int> B) {
    preA.resize(A.size() + 1, 0);
    preB.resize(B.size() + 1, 0);
    assert(A.size() == B.size());
    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]);
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20
• Subtask 4: 30 / 30