제출 #1178541

#제출 시각아이디문제언어결과실행 시간메모리
1178541PAndaSPyramids (IOI24_pyramids)C++20
0 / 100
34 ms4932 KiB
#include<iostream>
#include<vector>

using namespace std;

vector<long long> a_pr, b_pr;

void init(vector<int> a_in, vector<int> b_in){
    a_pr.resize(a_in.size() + 1, 0);
    b_pr.resize(b_in.size() + 1, 0);
    for(int i = 0; i < a_in.size(); i++){
        a_pr[i + 1] = a_pr[i] + a_in[i];
        b_pr[i + 1] = b_pr[i] + b_in[i];
    }
}

bool can_transform(int l, int r, int x, int y){
    return (b_pr[y + 1] - b_pr[x]) == (a_pr[l + 1] - a_pr[x]);
}
#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...