oj.uz

답안 #406520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406520 2021-05-17T17:18:21 Z bonopo 비밀 (JOI14_secret) C++14
0 / 100
 880 ms 15116 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define el "\n"
#define f first
#define s second

typedef long long ll;
const ll MM=1e3+5, MOD=1e9+7;
int N, a[MM], pfx[12][MM], sfx[12][MM];
map<pair<int,int>, int> mem;

int Secret(int X, int Y);

int doSecret(int X, int Y) {
    if(mem.find({X, Y})!=mem.end()) return mem[{X, Y}];
    return mem[{X, Y}]=Secret(X, Y);
}

void build(int l, int r, int lvl) {
    int m=(l+r)/2;
    for(int i=l; i<=m; ++i) {
        int c=a[i];
        for(int j=i+1; j<=m; ++j) c=doSecret(c, a[j]);
        sfx[lvl][i]=c; }
    for(int i=m+1; i<=r; ++i) {
        if(i==m+1) pfx[lvl][i]=a[i];
        else pfx[lvl][i]=doSecret(a[i], pfx[lvl][i-1]); }
    if(l<r) build(l, m, lvl+1), build(m+1, r, lvl+1);
}

int qry(int l, int r, int ql, int qr, int lvl) {
    int m=(l+r)/2;

    if(ql<=m+1&&qr>=m) {
        int p=(qr==m+0?0:pfx[lvl][qr]);
        int s=(ql==m+1?0:sfx[lvl][ql]);

        if(qr==m+0) return s;
        if(ql==m+1) return p;
        return doSecret(s, p);
    }

    if(ql<=m&&qr<=m) return qry(l, m, ql, qr, lvl+1);
    else return qry(m+1, r, ql, qr, lvl+1);
}

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

int Query(int L, int R) {
    return qry(0, N-1, L, R, 0);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 208 ms 5308 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 205 ms 5168 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 204 ms 5328 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 828 ms 14896 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 840 ms 15016 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 814 ms 15116 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 837 ms 15076 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 880 ms 14912 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 838 ms 14920 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 835 ms 14916 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.