oj.uz

Submission #1018179

# Submission time Handle Problem Language Result Execution time Memory
1018179 2024-07-09T15:55:04 Z TsotneSV Secret (JOI14_secret) C++17
0 / 100
 310 ms 4688 KB 
#pragma gcc diagnostic "-std=c++1z"
#include <bits/stdc++.h>
using namespace std;
/* /\_/\
  (= ._.)
  / >  \>
*/
//#pragma comment(linker, "/stack:200000000")
#include "secret.h"

// #define int long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define mp make_pair
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(0);}
#define endl '\n'
#define sz(x) ((long long) (x).size())
#define all(x) (x).begin(),(x).end()
#define print(x) cout<<(x)<<" ";
#define printl(x) cout<<(x)<<endl
#define dbg(x) cerr<<#x<<" "<<x<<endl

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

void fileIO(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;

const int inf=1e9,MAXN=2e5+5; 
const ll INF=1e18; 
const ld pi = 3.14159265358979323846;

int DAQ[1005][10],n,arr[1005];


void go(int l,int r,int lev) {

    if(l > r) return;

    if(l == r) {
        DAQ[l][lev] = arr[l];
        return;
    }

    int m = (l + r)/2; DAQ[m][lev] = arr[m]; DAQ[m+1][lev] = arr[m+1];

    for(int i=m-1;i>=l;i--) {
        DAQ[i][lev] = Secret(arr[i],DAQ[i+1][lev]);
    } 

    for(int i=m+2;i<=r;i++) {
        DAQ[i][lev] = Secret(arr[i],DAQ[i-1][lev]);
    }

    go(l,m,lev+1); go(m+1,r,lev+1);

}

void Init(int N, int A[]) {

    n = N;

    for(int i=0;i<n;i++) arr[i] = A[i];

    go(0,n-1,0);

}

int f(int l,int r,int tl = 0,int tr = n-1,int lev = 0) {

    int m = (tl + tr)/2;

    if(l <= m and r > m) {
        return lev;
    }else if(m < l) {
        return f(l,r,m+1,tr,lev+1);
    }else {
        return f(l,r,tl,m,lev+1);
    }

}

int Query(int L, int R) {

    if(L == R) return arr[L];

    int lev = f(L,R);
    return Secret(DAQ[L][lev],DAQ[R][lev]);

}

Compilation message

secret.cpp:1: warning: ignoring '#pragma gcc diagnostic' [-Wunknown-pragmas]
    1 | #pragma gcc diagnostic "-std=c++1z"
      | 
secret.cpp: In function 'void fileIO(std::string)':
secret.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
secret.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 90 ms 2748 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 78 ms 2648 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 77 ms 2824 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 310 ms 4436 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 303 ms 4688 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 309 ms 4432 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 296 ms 4436 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 794702233.
8 Incorrect 299 ms 4432 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 895279321.
9 Incorrect 298 ms 4436 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 760376136.
10 Incorrect 306 ms 4324 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 773787723.