oj.uz

답안 #578874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578874 2022-06-18T07:01:05 Z ddy888 비밀 (JOI14_secret) C++17
0 / 100
 484 ms 8292 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define si second
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 1010;
 
int n, arr[MAXN];
int t[MAXN][MAXN];
 
void dnc(int l, int r) {
    if (l == r) return;
    int m = (l + r) >> 1;
    t[m][m] = arr[m];
    t[m + 1][m + 1] = arr[m + 1];
    for (int i = m - 1; i >= l; --i) if (i <= n) t[i][m] = Secret(arr[i], t[i + 1][m]);
    for (int i = m + 2; i <= r; ++i) if (i <= n) t[m + 1][i] = Secret(arr[i], t[m + 1][i - 1]);
    dnc(l, m);
    dnc(m + 1, r);
}
 
void Init(int N, int A[]) {
    n = N;
    for (int i = 1; i <= n; ++i) arr[i] = A[i - 1];
    dnc(1, n);
}
 
int Query(int L, int R) {
    ++L, ++R;
    if (L == R) return arr[L];
    int l = 1, r = n;
    while (l != r) {
        int m = (l + r) >> 1;
        if (L <= m && r > m) return Secret(t[L][m], t[m + 1][R]);
        if (L >= m) l = m;
        else if (R < m) r = m;
    } 
    return t[l][r];        
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 129 ms 4460 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 587620235.
2 Incorrect 129 ms 4472 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 128 ms 4464 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 440 ms 8260 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 846921768.
5 Incorrect 460 ms 8212 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 475 ms 8260 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 949167361.
7 Incorrect 483 ms 8276 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 452 ms 8244 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 484 ms 8292 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 472 ms 8276 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.