oj.uz

답안 #735264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735264 2023-05-03T19:32:04 Z Wael 비밀 (JOI14_secret) C++14
0 / 100
 461 ms 8444 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int long long
#define F first
#define S second
//#define endl '\n'
#define INT INT_MAX
int const M = 1e3 + 10 , N = 3e6 , lg = 25 , mod = 1e9 + 7;
int dx[] = {0 , 0 , -1 , 1 , 1 , 1 , -1 , -1};
int dy[] = {1 , -1 , 0 , 0 , 1 , -1 , 1 , -1};
int T , n , j , ans[M][M] , a[M] , Q , l , r , Size , s[M];
/*
inline ll Secret(int x , int y) {
    //cout << x << " " << y << endl;
    int res;
    res = x + y;
    return res;
}
*/

inline void Go(int x = 1 , int lx = 1 , int rx = Size) {

    if(lx > n) return;
    if(lx == rx) {
        ans[lx][rx] = s[lx];
        return;
    }
    int mid = (lx + rx) / 2;
    int a = mid , b = mid + 1;
    ans[b][b] = s[b];
    for(int i = b + 1 ; i <= min(rx , n) ; ++i) ans[b][i] = Secret(ans[b][i - 1] , s[i]);

    ans[a][a] = s[a];
    if(a <= n) for(int i = a - 1 ; i >= lx ; --i) ans[i][a] = Secret(ans[i + 1][a] , s[i]);
    Go(2 * x , lx , mid);
    Go(2 * x + 1 , mid + 1 , rx);

}

inline ll Get(int l , int r , int x = 1 , int lx = 1 , int rx = Size) {

    int mid = (lx + rx) / 2;
    if(mid >= l && mid <= r) return Secret(ans[l][mid] , ans[mid + 1][r]);
    if(l > mid) return Get(l , r , 2 * x + 1 , mid + 1 , rx);
    else return Get(l , r , 2 * x,  lx , mid);

}

void Init(int sz , int ar[]) {

    n = sz;
    for(int i = n ; i >= 1 ; --i) s[i] = ar[i - 1];
    Size = (1 << 10);
    Go();

}

int Query(int l , int r) {

    return Get(l , r);

}
/*
main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);


    return 0;
}
*/

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 123 ms 4396 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 823269916.
2 Incorrect 121 ms 4492 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 617718217.
3 Incorrect 117 ms 4480 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 746961190.
4 Incorrect 456 ms 8308 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 103367348.
5 Incorrect 452 ms 8320 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 444745748.
6 Incorrect 447 ms 8308 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 9110075.
7 Incorrect 444 ms 8444 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 781356043.
8 Incorrect 461 ms 8396 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 499396624.
9 Incorrect 457 ms 8248 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 270284044.
10 Incorrect 454 ms 8292 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 608268225.