oj.uz

답안 #293358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293358 2020-09-08T00:35:01 Z XmtosX 비밀 (JOI14_secret) C++17
0 / 100
 514 ms 8440 KB 
#include <bits/stdc++.h>;
#include "secret.h"
using namespace std;
#define LL pos*2+1
#define RR pos*2+2
const int NN=1e3+3;
int a[NN],n,ans[NN][NN],l,r;
void solve(int st,int en)
{
    if (st>en)
        return;
    int mid=(st+en)/2;
    ans[mid][mid]=a[mid];
    ans[mid+1][mid+1]=a[mid+1];
    for (int i=mid+2;i<=en;i++)
        ans[mid+1][i]=Secret(ans[mid+1][i-1],a[i]);
    for (int i=mid-1;i>=st;i--)
        ans[i][mid]=Secret(a[i],ans[i+1][mid]);
    solve(st,mid-1);
    solve(mid+1,en);
}
int query(int st,int en)
{
    int mid=(st+en)/2;
    if (mid>r)
        return query(st,mid-1);
    if (mid<l)
        return query(mid+1,en);
    return Secret(ans[l][mid],ans[mid+1][r]);
}
void Init(int N, int A[])
{
    n=N;
    for (int i=0;i<n;i++)
        a[i]=A[i];
    solve(0,n-1);
}
int Query(int L, int R)
{
    l=L;
    r=R;
    if (l==r)
        return a[l];
    if (l+1==r)
        return Secret(a[l],a[r]);
    return query(0,n-1);
}
/*
8
1 4 7 2 5 8 3 6
4
0 3
1 7
5 5
2 4
*/

Compilation message

secret.cpp:1:25: warning: extra tokens at end of #include directive
    1 | #include <bits/stdc++.h>;
      |                         ^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 4344 KB Wrong Answer: Query(264, 271) - expected : 675707686, actual : 4619042.
2 Incorrect 133 ms 4472 KB Wrong Answer: Query(262, 383) - expected : 858891369, actual : 858890345.
3 Incorrect 133 ms 4472 KB Wrong Answer: Query(339, 352) - expected : 476808934, actual : 472088678.
4 Incorrect 499 ms 8416 KB Wrong Answer: Query(571, 624) - expected : 309502044, actual : 309493852.
5 Incorrect 503 ms 8272 KB Wrong Answer: Query(584, 592) - expected : 111053842, actual : 110791698.
6 Incorrect 503 ms 8248 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 950134466.
7 Correct 514 ms 8184 KB Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1
8 Correct 506 ms 8184 KB Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1
9 Correct 511 ms 8440 KB Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1
10 Correct 511 ms 8312 KB Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1