# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
165329 |
2019-11-26T11:56:01 Z |
jovan_b |
Secret (JOI14_secret) |
C++17 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
using namespace std;
#include "secret.h"
typedef long double ld;
typedef long long ll;
ll niz[1005];
ll res[1005][1005];
ll n;
ll fajnd(ll l, ll r, ll trl, ll trr){
if(r-l <= 1) return -1;
ll mid = (l+r)/2;
if(l <= trl && trr <= r && trl <= mid && tr >= mid+1) return mid;
ll x = fajnd(l, mid, trl, trr);
if(x != -1) return x;
return fajnd(mid+1, r, trl, trr);
}
void process(ll l, ll r){
ll i = (l+r)/2;
if(i+1 > r || i < l) return;
res[i][i] = niz[i];
res[i+1][i+1] = niz[i+1];
for(ll j=i-1; j>=l; j--){
res[j][i] = Secret(niz[j], res[j+1][i]);
}
for(ll j=i+2; j<=r; j++){
res[i+1][j] = Secret(res[i+1][j-1], niz[j]);
}
process(l, i);
process(i+1, r);
}
void Init(int N, int A[]){
n = N;
for(ll i=0; i<N; i++) niz[i] = A[i];
process(0, n-1);
}
int Query(int L, int R){
if(L == R) return niz[L];
if(R == L+1) return Secret(niz[L], niz[R]);
ll i = fajnd(0, n-1, L, R);
return Secret(res[L][i], res[i+1][R]);
}
Compilation message
secret.cpp: In function 'll fajnd(ll, ll, ll, ll)':
secret.cpp:14:46: error: 'tr' was not declared in this scope
if(l <= trl && trr <= r && trl <= mid && tr >= mid+1) return mid;
^~
secret.cpp:14:46: note: suggested alternative: 'r'
if(l <= trl && trr <= r && trl <= mid && tr >= mid+1) return mid;
^~
r