oj.uz

Submission #525489

# Submission time Handle Problem Language Result Execution time Memory
525489 2022-02-11T19:12:31 Z omohamadooo Secret (JOI14_secret) C++14
0 / 100
 439 ms 4640 KB 
#include "secret.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll,ll >
#define F first
#define S second
#define double long double
#define all(x) (x).begin(),(x).end()
using namespace std;
using namespace __gnu_pbds;

typedef tree<ll , null_type , less_equal<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set;

const int MOD=998244353 ;
const int  N=1e6+ 7;
const ll INF= 1e18+10;

struct trp{ll F,S,T;};

ll po(ll x,ll y)
{
    ll ans = 1;
    while(y){
        if( y & 1 ) ans *=x;
        y /= 2;
        x *=x;
        x %= MOD;
        ans %= MOD;
    }
    return ans;
}

int n;
ll suf[N][20];
ll pref[N][20];
vector<int>v;

void get(ll l,ll r,ll lg)
{
    if(l == r) return;
    ll m = (l+r)/2;
    suf[m][lg] = v[m];
    pref[m+1][lg] = v[m+1];
    ll j = 1;
    for(ll i= m-1;i>=l;i--){
        suf[i][lg] = Secret(suf[i+1][lg] , v[i]);
    }
    j = 1;
    for(ll i=m+2;i<=r;i++){
        pref[i][lg] = Secret(pref[i-1][lg] , v[i]);
    }
    get(l,m,lg+1);
    get(m+1,r,lg+1);
}

void Init(int f , int *a)
{
    n = f;
    for(ll i=0;i<n;i++) v.pb(a[i]);
    get(0,n-1,0);
}

ll get_ans(ll segl,ll segr,ll l,ll r,ll lg)
{
    ll m = (segl + segr)/2;
    if( m == l+1 ) return pref[r][lg];
    if( m == r ) return suf[l][lg];
    if(m >= l && m < r){
        return Secret(suf[l][lg] , pref[r][lg]);
    }
    if(l > m) return get_ans(m+1,segr,l,r,lg+1);
    else return get_ans(segl,m,l,r,lg+1);
}

int Query(int l, int r)
{
    if(l ==  r) return v[l];
    return get_ans(0,n-1 , l,r , 0);
}

Compilation message

secret.cpp: In function 'void get(long long int, long long int, long long int)':
secret.cpp:48:8: warning: variable 'j' set but not used [-Wunused-but-set-variable]
   48 |     ll j = 1;
      |        ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 2456 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 324100526.
2 Incorrect 121 ms 2524 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 110 ms 2424 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 424 ms 4568 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 430 ms 4524 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 439 ms 4604 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 413 ms 4640 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 415 ms 4564 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 420 ms 4548 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 416 ms 4556 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.