Submission #1157363

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157363		nguyn	Secret (JOI14_secret)	C++20	0 / 100	337 ms	4496 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>

using namespace std;

#define MAX_N                  1000
#define MAX_Q                 10000
#define MAX_VALUE        1000000000
#define pii pair<int, int>
#define F first
#define S second

//static int N;
//static int A[MAX_N];
//static int Q;
//static int L[MAX_Q];
//static int secret_count;
//static int R[MAX_Q];
//
//int Secret(int X, int Y) {
//  ++secret_count;
//  if (!(0 <= X && X <= MAX_VALUE)) {
//    fprintf(stderr, "Wrong Answer [1]\n");
//    exit(0);
//  }
//  if (!(0 <= Y && Y <= MAX_VALUE)) {
//    fprintf(stderr, "Wrong Answer [1]\n");
//    exit(0);
//  }
//  return (X + 2 * (Y / 2) < MAX_VALUE) ? (X + 2 * (Y / 2)) : MAX_VALUE;
//}

int n, a[MAX_N];
int pre[15][MAX_N];
int suf[15][MAX_N];

void dnc(int deg, int l, int r) {
    if (l == r) {
        pre[deg][l] = a[l];
        return;
    }
    int mid = (l + r) / 2;
    pre[deg][mid] = a[mid];
    for (int i = mid + 1; i <= r; i++) {
        pre[deg][i] = Secret(pre[deg][i - 1], a[i]);
    }
    suf[deg][mid - 1] = a[mid - 1];
    for (int i = mid - 2; i >= l; i--) {
        suf[deg][i] = Secret(a[i], suf[deg][i + 1]);
    }
    dnc(deg + 1, l, mid);
    dnc(deg + 1, mid + 1, r);
}

void Init(int N, int A[]) {
    n = N;
    for (int i = 1; i <= n; i++) {
        a[i] = A[i - 1];
    }
    dnc(1, 1, n);
}

pii get(int id, int l, int r, int u, int v) {
    int mid = (l + r) / 2;
    if (u <= mid && mid <= v) {
        return {id, mid};
    }
    if (u > mid) {
        return get(id + 1, mid + 1, r, u, v);
    }
    return get(id + 1, l, mid, u, v);
}

int Query(int L, int R) {
    int l = L + 1;
    int r = R + 1;
    if (l == r) return a[l];
    pii it = get(1, 1, n, l, r);
    int deg = it.F;
    int mid = it.S;
    if (mid == l) {
        return pre[deg][r];
    }
//    cout << deg << ' ' << mid << '\n';
    return Secret(suf[deg][l], pre[deg][r]);
}

//int main() {
//  int i, j;
//  int secret_count_by_init;
//  int max_secret_count_by_query = 0;
//
//  if (1 != scanf("%d", &N)) {
//    fprintf(stderr, "error: cannot read N.\n");
//    exit(1);
//  }
//  if (!(1 <= N && N <= MAX_N)) {
//    fprintf(stderr, "error: N is out of bounds.\n");
//    exit(1);
//  }
//  for (i = 0; i < N; ++i) {
//    if (1 != scanf("%d", &A[i])) {
//      fprintf(stderr, "error: cannot read A[%d].\n", i);
//      exit(1);
//    }
//    if (!(0 <= A[i] && A[i] <= MAX_VALUE)) {
//      fprintf(stderr, "error: A[%d] is out of bounds.\n", i);
//      exit(1);
//    }
//  }
//  if (1 != scanf("%d", &Q)) {
//    fprintf(stderr, "error: cannot read Q.\n");
//    exit(1);
//  }
//  if (!(0 <= Q && Q <= MAX_Q)) {
//    fprintf(stderr, "error: Q is out of bounds.\n");
//    exit(1);
//  }
//  for (j = 0; j < Q; ++j) {
//    if (2 != scanf("%d%d", &L[j], &R[j])) {
//      fprintf(stderr, "error: cannot read L[%d] and R[%d].\n", j, j);
//      exit(1);
//    }
//    if (!(0 <= L[j] && L[j] <= R[j] && R[j] <= N - 1)) {
//      fprintf(stderr,
//              "error: L[%d] and R[%d] do not satisfy the constraints.\n",
//              j, j);
//      exit(1);
//    }
//  }
//
//  secret_count = 0;
//  Init(N, A);
//  secret_count_by_init = secret_count;
//
//  for (j = 0; j < Q; ++j) {
//    secret_count = 0;
//    printf("%d\n", Query(L[j], R[j]));
//    if (max_secret_count_by_query < secret_count) {
//      max_secret_count_by_query = secret_count;
//    }
//  }
//
//  fprintf(stderr, "number of calls to Secret by Init : %d\n",
//          secret_count_by_init);
//  fprintf(stderr, "maximum number of calls to Secret by Query : %d\n",
//          max_secret_count_by_query);
//
//  return 0;
//}

• Subtask 1: 0 / 100