Submission #1131400

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131400		bachhoangxuan	Pyramids (IOI24_pyramids)	C++20	100 / 100	65 ms	5084 KiB

pyramids

#include "pyramids.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
#define ll long long
ll A[maxn],B[maxn];

void init(std::vector<int> _A, std::vector<int> _B) {
    int N=(int)_A.size();
    for(int i=1;i<=N;i++) A[i]=A[i-1]+_A[i-1],B[i]=B[i-1]+_B[i-1];
}

bool can_transform(int L, int R, int X, int Y) {
    return (A[R+1]-A[L]==B[Y+1]-B[X]);
}

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