제출 #1165937

#제출 시각아이디문제언어결과실행 시간메모리
1165937aminabouakazPyramids (IOI24_pyramids)C++20
0 / 100
1095 ms5028 KiB
#include <vector> using namespace std; vector<int> pyramidsA, pyramidsB; vector<int> sumA, sumB; void init(vector<int> A, vector<int> B) { pyramidsA = A; pyramidsB = B; sumA = A; sumB = B; for (int i = 1; i < A.size(); ++i) { sumA[i] += sumA[i - 1]; sumB[i] += sumB[i - 1]; } } bool can_transform(int L, int R, int X, int Y) { if (sumA[R] - (L > 0 ? sumA[L - 1] : 0) != sumB[Y] - (X > 0 ? sumB[X - 1] : 0)) { return false; } int balanceA = 0, balanceB = 0; for (int i = L; i <= R; ++i) { balanceA += pyramidsA[i] % 2; } for (int i = X; i <= Y; ++i) { balanceB += pyramidsB[i] % 2; } return balanceA == balanceB; }
#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...