oj.uz

Submission #606172

# Submission time Handle Problem Language Result Execution time Memory
606172 2022-07-26T05:23:14 Z kawaii Secret (JOI14_secret) C++14
100 / 100
 527 ms 8336 KB 
#include "secret.h"
#include<bits/stdc++.h>
using namespace std;
 
int n, a[1005], pre[1005][1005];

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

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

int solve(int l, int r, int lf, int rt){
    if(l == r) return a[l];
    int mid = l + r >> 1;
    if(lf <= mid && mid <= rt){
        if(rt == mid) return pre[lf][mid];
        if(lf == mid) return Secret(a[lf], pre[mid + 1][rt]);
        return Secret(pre[lf][mid], pre[mid + 1][rt]);
    }
    if(rt < mid) return solve(l, mid, lf, rt);
    else return solve(mid + 1, r, lf, rt);
}

int Query(int L, int R){
    L++; R++;
    return solve(1, n, L, R);
}

Compilation message

secret.cpp: In function 'void dnc(int, int)':
secret.cpp:9:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    9 |     int mid = l + r >> 1;
      |               ~~^~~
secret.cpp: In function 'int solve(int, int, int, int)':
secret.cpp:23:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   23 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 4396 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 142 ms 4328 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 131 ms 4404 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 491 ms 8192 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 469 ms 8336 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 485 ms 8216 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 470 ms 8220 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 527 ms 8152 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 479 ms 8280 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 505 ms 8192 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1