oj.uz

답안 #1100943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100943 2024-10-15T04:41:30 Z doducanh 비밀 (JOI14_secret) C++14
0 / 100
 322 ms 8296 KB 
///breaker
#include "secret.h"
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
#define mp make_pair
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define bit(x,i) ((x>>i)&1)
#define lc (id<<1)
#define rc ((id<<1)^1)
const int maxn=1005;
int pre[maxn][maxn];
int a[maxn];
int n;
void dac(int l,int r)
{
    int m=(l+r)/2;
    pre[m][m]=a[m];
    pre[m+1][m+1]=a[m+1];
    for(int i=m-1;i>=l;i--){
        pre[m][i]=Secret(a[i],pre[m][i+1]);
    }
    for(int i=m+2;i<=r;i++){
        pre[m+1][i]=Secret(pre[m+1][i-1],a[i]);
    }
    if(l<m)dac(l,m);
    if(m+1<r)dac(m+1,r);
}
void Init(int N,int A[])
{
    n=N;
    for(int i=0;i<n;i++){
        a[i]=A[i];
    }
    dac(0,n-1);
}
int Query(int l,int r)
{
    int lo=0,hi=n-1;
    while(lo!=hi){
        int m=(lo+hi)/2;
        if(m>=l&&m<r){
            return Secret(pre[m][l],pre[m+1][r]);
        }
        else if(m==r){
            return pre[m][l];
        }
        else if(m<l){
            lo=m+1;
        }
        else r=m;
    }
    return pre[lo][lo];
}
/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 78 ms 6728 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 587620239.
2 Incorrect 79 ms 6728 KB Wrong Answer: Query(102, 157) - expected : 32612619, actual : 962726377.
3 Incorrect 80 ms 6728 KB Wrong Answer: Query(334, 369) - expected : 363022362, actual : 16889894.
4 Incorrect 311 ms 8264 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 846921768.
5 Incorrect 307 ms 8296 KB Wrong Answer: Query(263, 292) - expected : 653448456, actual : 710055954.
6 Incorrect 303 ms 8132 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 546595440.
7 Correct 311 ms 8236 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 310 ms 8296 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 314 ms 8296 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 322 ms 8296 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1