Submission #578695

#	Time	Username	Problem	Language	Result	Execution time	Memory
578695		ddy888	Secret (JOI14_secret)	C++17	0 / 100	471 ms	8532 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define si second
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 1030;
 
int n, arr[MAXN];
int t[MAXN][MAXN];
int lx[MAXN], rx[MAXN];
 
void dnc(int l, int r) {
    if (l == r) return;
    int m = (l + r) >> 1;
    t[m][m] = arr[m];
    t[m + 1][m + 1] = arr[m + 1];
    for (int i = m - 1; i >= l; --i) if (i <= n) t[i][m] = Secret(arr[i], t[i + 1][m]);
    for (int i = m + 2; i <= r; ++i) if (i <= n) t[m + 1][i] = Secret(arr[i], t[m + 1][i - 1]);
    lx[m] = l;
    rx[m + 1] = r;
    dnc(l, m);
    dnc(m + 1, r);
}
 
void Init(int N, int A[]) {
    n = N;
    for (int i = 1; i <= n; ++i) arr[i] = A[i - 1];
    int sz = 1;
    while (sz < n) sz *= 2;
    dnc(1, sz);
}
 
int Query(int L, int R) {
    ++L, ++R;
    if (L == R) return arr[L];
    for (int i = 0; i <= 10; ++i) {
        int m = (1 << i);
        if (lx[m] <= L && rx[m + 1] >= R) return Secret(t[L][m], t[m + 1][R]);
    }
}

Compilation message (stderr)

secret.cpp: In function 'int Query(int, int)':
secret.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

• Subtask 1: 0 / 100