Submission #348832

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
3488322021-01-15 20:35:30spatarelSecret (JOI14_secret)C++17
100 / 100
521 ms4844 KiB
#include "secret.h"
#include <map>
struct StructQuery {
int left;
int right;
};
bool operator < (const StructQuery &a, const StructQuery &b) {
return (a.left < b.left)
|| (a.left == b.left && a.right < b.right);
}
int n;
std::map<StructQuery, int> secrets;
void querySecrets(int left, int right, int A[]) {
if (left == right) {
secrets[StructQuery{left, right}] = A[left];
} else {
int avg = (left + right) / 2;
secrets[StructQuery{avg, avg}] = A[avg];
for (int i = avg - 1; i >= left; i--) {
secrets[StructQuery{i, avg}] =
Secret(A[i], secrets[StructQuery{i + 1, avg}]);
}
secrets[StructQuery{avg + 1, avg + 1}] = A[avg + 1];
for (int i = avg + 2; i <= right; i++) {
secrets[StructQuery{avg + 1, i}] =
Secret(secrets[StructQuery{avg + 1, i - 1}], A[i]);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...