oj.uz

Submission #1085598

# Submission time Handle Problem Language Result Execution time Memory
1085598 2024-09-08T13:11:50 Z MrPavlito Secret (JOI14_secret) C++17
0 / 100
 324 ms 9300 KB 
#include "secret.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e3+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
int niz[MAXN];
int n;
map<pii, int> mapa;
vector<vector<int>> v(MAXN, vector<int>(MAXN));

int ask(int a, int b)
{
    if(mapa.count(mp(a,b)))return mapa[mp(a,b)];
    int p =  Secret(a,b);
    mapa[{a,b}] = p;
    return p;
}

void build(int l, int r, int lvl)
{
    if(l == r)return;
    int mid = l+r >> 1;
    v[mid][mid] = niz[mid];
    v[mid+1][mid+1] = niz[mid+1];
    for(int i=mid+2;i<=r; i++)v[mid+1][i] = ask(v[mid+1][i-1], niz[i]);
    for(int i=mid-1;i>=l; i--)v[mid][i] = ask( niz[i],v[mid][i+1]);
    //for(int i=mid;i>=l; i--)cout << v[lvl][i] << " ";cout << endl;
    build(l, mid, lvl+1);
    build(mid+1,r, lvl+1);
}


int query(int l, int r, int lvl, int L, int R)
{
    int mid = l+r>>1;
    if(L <= mid && R> mid)return ask(v[mid][L], v[mid+1][R]);
    else if(R == mid)return v[mid][L];
    else if(L > mid)return query(mid+1, r, lvl+1, L, R);
    else return query(l, mid+1, lvl+1, L, R);
}

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

int Query(int L, int R) {
    if(L == R)return niz[L+1];
  return (query(1, n, 0, L+1, R+1));
}

Compilation message

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 82 ms 6740 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912.
2 Incorrect 82 ms 6736 KB Wrong Answer: Query(102, 157) - expected : 32612619, actual : 0.
3 Incorrect 86 ms 6740 KB Wrong Answer: Query(334, 369) - expected : 363022362, actual : 536870912.
4 Incorrect 308 ms 8788 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912.
5 Incorrect 311 ms 8784 KB Wrong Answer: Query(263, 292) - expected : 653448456, actual : 536870912.
6 Incorrect 324 ms 8784 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 950174288.
7 Correct 315 ms 9296 KB Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1
8 Correct 323 ms 9280 KB Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1
9 Correct 321 ms 9280 KB Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1
10 Correct 319 ms 9300 KB Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1