#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mmod = 998244353;
#define vl vector<long long>
#define vll vector<vector<long long>>
#define pl pair<long long, long long>
#define vb vector<bool>
vl p1,p2;
void init(std::vector<int> A, std::vector<int> B){
ll n = A.size();
p1 = {0};
p2 = {0};
for (ll i = 0; i < n; i++){
p1.push_back(p1[i] + A[i]);
p2.push_back(p2[i] + B[i]);
}
}
bool can_transform(int L, int R, int X, int Y){
if (p1[R+1] - p1[L] == p2[Y+1] - p2[X]){
return true;
}
else{
return false;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |