oj.uz

답안 #525538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525538 2022-02-11T22:02:41 Z omohamadooo 비밀 (JOI14_secret) C++14
0 / 100
 468 ms 12164 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;
int v[N];
int pref[4005][1005],suf[4005][1005];

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

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

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

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

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 119 ms 6392 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 117 ms 6292 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 117 ms 6416 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 468 ms 12164 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 418 ms 12032 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 436 ms 12100 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 423 ms 12140 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 430 ms 12116 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 426 ms 12128 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 436 ms 12112 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.