This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// failed/solution-prabowo-n-equals-one.cpp
// O(QM)
#include "circuit.h"
#include <numeric>
#include <vector>
std::vector<int> A;
void init(int, int, std::vector<int>, std::vector<int> _A) {
A = _A;
}
int count_ways(int L, int R) {
for (int j = --L; j < R; ++j) {
A[j] ^= 1;
}
return std::accumulate(A.begin(), A.end(), 0);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |