oj.uz

Submission #1053626

# Submission time Handle Problem Language Result Execution time Memory
1053626 2024-08-11T14:34:43 Z phong Secret (JOI14_secret) C++17
30 / 100
 307 ms 4532 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
//#include<bits/stdc++.h>
#include "secret.h"

#define ll long long
const int nmax = 1000 + 5;

using namespace std;

int n, a[nmax];
int tree[nmax << 2];

void build(int id, int l, int r){
    if(l == r){
        tree[id] = a[l];
        return;
    }
    int mid = r + l >> 1;
    build(id << 1, l, mid);
    build(id << 1| 1, mid + 1, r);
    tree[id] = Secret(tree[id << 1], tree[id << 1 | 1]);
}
int get(int id, int l, int r, int u, int v){
    if(l >= u && r <= v) return tree[id];
    int mid = r + l >> 1;
    if(mid< u) return get(id << 1 | 1, mid + 1, r, u, v);
    if(mid + 1 > v) return get(id << 1, l, mid, u, v);
    return Secret(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
void Init(int N, int A[]){
    n = N;
    for(int i = 0; i < n; ++i) a[i] = A[i];
    build(1, 0, n - 1);

}
int Query(int l, int r){
    return get(1, 0, n - 1, l, r);
}

Compilation message

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

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 92 ms 3664 KB Output is partially correct - number of calls to Secret by Init = 510, maximum number of calls to Secret by Query = 13
2 Partially correct 91 ms 3664 KB Output is partially correct - number of calls to Secret by Init = 511, maximum number of calls to Secret by Query = 14
3 Partially correct 92 ms 3668 KB Output is partially correct - number of calls to Secret by Init = 512, maximum number of calls to Secret by Query = 15
4 Partially correct 283 ms 4432 KB Output is partially correct - number of calls to Secret by Init = 998, maximum number of calls to Secret by Query = 15
5 Partially correct 278 ms 4300 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 15
6 Partially correct 255 ms 4432 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 4
7 Partially correct 307 ms 4532 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
8 Partially correct 297 ms 4456 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
9 Partially correct 291 ms 4436 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
10 Partially correct 292 ms 4380 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16