제출 #1240498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1240498		rayan_bd	Pyramids (IOI24_pyramids)	C++20	100 / 100	40 ms	5040 KiB

pyramids

#include <bits/stdc++.h>
#include "pyramids.h"
using namespace std;

vector<long long> prefA, prefB;

void init(std::vector<int> A, std::vector<int> B){
    int n = (int) A.size();
    prefA.resize(n, 0);
    prefB.resize(n, 0);
    prefA[0] = A[0], prefB[0] = B[0];
    for(int i = 1; i < n; ++i){
        prefA[i] = prefA[i - 1] + A[i];
        prefB[i] = prefB[i - 1] + B[i];
    }
}

bool can_transform(int L, int R, int X, int Y){
    long long A = prefA[R], B = prefB[Y];
    if(L > 0) A -= prefA[L - 1];
    if(X > 0) B -= prefB[X - 1];
    return A == B;
}

/*int main(){
    init({1, 2, 3, 4, 5}, {2, 2, 2, 4, 5});
    cout << can_transform(0, 2, 0, 2) << endl;
    cout << can_transform(3, 4, 3, 4) << endl;
    cout << can_transform(0, 2, 1, 3) << endl;
    return 0;
}*/

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