oj.uz

답안 #1086693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086693 2024-09-11T09:27:24 Z LeonidCuk 비밀 (JOI14_secret) C++17
0 / 100
 312 ms 4456 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
vector<int>v,dp[20];
void daq(int i,int l,int r)
{
    if(l==r)
    {
        dp[i][l]=v[l];
        return;
    }
    int m=(l+r)/2;
    dp[i][m]=v[m];
    for(int j=m-1;j>=l;j--)
    {
        dp[i][j]=Secret(v[j],dp[i][j+1]);
    }
    dp[i][m+1]=v[m+1];
    for(int j=m+2;j<=r;j++)
    {
        dp[i][j]=Secret(dp[i][j-1],v[j]);
    }
    daq(i+1,l,m);
    daq(i+1,m+1,r);
}
int najdi(int i,int l,int r)
{
    if(l==r)
    {
        return v[l];
    }
    int m=(l+r)/2;
    if(l<=m&&m<r)
    {
        return Secret(dp[i][l],dp[i][r]);
    }
    else if(r<=m)
    {
        return najdi(i+1,l,m);
    }
    else
    {
        return najdi(i+1,m+1,r);
    }
}
void Init(int N,int A[])
{
    for(int i=0;i<N;i++)
    {
        v.push_back(A[i]);
    }
    for(int i=0;i<20;i++)
    {
        dp[i].resize(N);
    }
    daq(0,0,N-1);
}
int Query(int l,int r)
{
      return najdi(0,l,r);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 80 ms 2476 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 574960662.
2 Incorrect 79 ms 2384 KB Wrong Answer: Query(102, 157) - expected : 32612619, actual : 697381057.
3 Incorrect 80 ms 2620 KB Wrong Answer: Query(334, 369) - expected : 363022362, actual : 8613892.
4 Incorrect 304 ms 4456 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 274825282.
5 Incorrect 300 ms 4436 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 307380480.
6 Incorrect 309 ms 4432 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 950550627.
7 Correct 308 ms 4324 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 308 ms 4436 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 306 ms 4432 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 312 ms 4392 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1