oj.uz

답안 #488388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488388 2021-11-18T19:20:57 Z AmirElarbi 비밀 (JOI14_secret) C++14
0 / 100
 445 ms 8376 KB 
#include <bits/stdc++.h>
#include "secret.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 1005;
int n;
vi s;
int t[nax][nax];
void solve(int l, int r){
    if(l >= r-1) return;
    int md = (l+r)/2;
    t[md][md] = s[md];
    t[md+1][md+1] = s[md+1];
    //cout << l << " " << r << endl;
    for (int i = md+2; i <= r; ++i)
    {
        t[md+1][i] = Secret(t[md+1][i-1],s[i]);
        //cout << i << endl;
    }
    for (int i = md-1; i >= l; --i)
    {
        t[i][md] = Secret(t[i+1][md],s[i]);
        //cout << i << endl;
    }
    if(l < md) solve(l,md);
    if(md +1 < r) solve(md+1,r);
}
void Init(int N, int A[]){
    n = N;
    for (int i = 0; i < N; ++i)
    {
        s.pb(A[i]);
    }
    solve(0,n-1);
}
int Query(int L, int R){
    int l = 0, r = n-1;
    int md = (l+r)/2;
    while(!(L <= md && md <= R)){
        md = (l+r)/2;
        if(md == R) return t[L][md];
        if(md > R)
            r = md;
        else
            l = md+1;
    }
    if(l == r)
        return t[l][l];
    return Secret(t[L][md],t[md+1][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 109 ms 4292 KB Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673.
2 Incorrect 110 ms 4404 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 109 ms 4352 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 402 ms 8268 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 414 ms 8212 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 418 ms 8376 KB Wrong Answer: Query(250, 258) - expected : 907404, actual : 997709.
7 Incorrect 445 ms 8152 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 421 ms 8152 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 408 ms 8268 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 408 ms 8260 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.