oj.uz

Submission #67314

# Submission time Handle Problem Language Result Execution time Memory
67314 2018-08-13T22:04:41 Z duality Secret (JOI14_secret) C++11
100 / 100
 646 ms 9332 KB 
#include <bits/stdc++.h>
using namespace std;

// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "secret.h"

int n;
int arr[1000];
int secret[1000][1000];
int build(int s,int e) {
    if (s == e) {
        secret[s][e] = arr[s];
        return 0;
    }

    int i;
    int mid = (s+e) / 2;
    build(s,mid);
    build(mid+1,e);
    if ((s > 0) || (e < (n-1))) {
        for (i = s; i <= mid; i++) secret[i][e] = Secret(secret[i][mid],secret[mid+1][e]);
        for (i = mid+1; i < e; i++) secret[s][i] = Secret(secret[s][mid],secret[mid+1][i]);
    }
    return 0;
}
int query(int s,int e,int qs,int qe) {
    if (s == e) return secret[s][e];

    int mid = (s+e) / 2;
    if (qe <= mid) return query(s,mid,qs,qe);
    else if (qs > mid) return query(mid+1,e,qs,qe);
    else return Secret(secret[qs][mid],secret[mid+1][qe]);
}

void Init(int N,int A[]) {
    int i;
    n = N;
    for (i = 0; i < N; i++) arr[i] = A[i];
    build(0,n-1);
}
int Query(int L,int R) {
    return query(0,n-1,L,R);
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 4600 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 194 ms 4836 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 184 ms 4836 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 643 ms 8604 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 628 ms 8884 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 621 ms 9032 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 606 ms 9312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 646 ms 9312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 614 ms 9332 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 641 ms 9332 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1