oj.uz

Submission #952536

# Submission time Handle Problem Language Result Execution time Memory
952536 2024-03-24T07:39:12 Z Whisper Secret (JOI14_secret) C++17
100 / 100
 384 ms 8448 KB 
#include <bits/stdc++.h>
#include <secret.h>
using namespace std;
using ll = long long;
 
//#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
 
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
 
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
//void setupIO(){
//    #define name "Whisper"
//    //Phu Trong from Nguyen Tat Thanh High School for gifted student
//    srand(time(NULL));
//    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//    freopen(name".inp", "r", stdin);
//    freopen(name".out", "w", stdout);
//    cout << fixed << setprecision(10);
//}
 
template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }
 
template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
vector<int> a;
int nArr;
vector<vector<int>> sum;
//int Secret(int lx, int rx){
//    return (lx + rx);
//}
void dnc(int l, int r){
    if  (l == r){
        sum[l][l] = a[l];
        return;
    }
    if (l > r) return;
    int mid = (l + r) >> 1;
 
    sum[mid][mid] = a[mid];
    sum[mid + 1][mid + 1] = a[mid + 1];
    for (int i = mid - 1; i >= l; --i) sum[i][mid] = Secret(a[i], sum[i + 1][mid]);
    for (int i = mid + 2; i <= r; ++i) sum[mid + 1][i] = Secret(sum[mid + 1][i - 1], a[i]);
    dnc(l, mid);
    dnc(mid + 1, r);
}
void Init(int N, int A[]){
    a.resize(N);
    sum.resize(N, vector<int>(N));
    nArr = N;
    for (int i = 0; i < N; ++i) a[i] = A[i];
    dnc(0, nArr - 1);
}
int Get(int l, int r, int u, int v){
    int mid = (l + r) >> 1;
    if (u <= mid && mid < v) return Secret(sum[u][mid], sum[mid + 1][v]);
    if (u <= mid)
        return Get(l, mid, u, v);
    return Get(mid + 1, r, u, v);
}
 
int Query(int l, int r){
    return (l == r ? a[l] : Get(0, nArr - 1, l, r));
}
//void Whisper(){
//    int a[8] = {1, 4, 7, 2, 5, 8, 3, 6};
//    Init(8, a);
//    cout << "CASE 1: " << Query(0, 3) << '\n';
//    cout << "CASE 2: " << Query(1, 7) << '\n';
//    cout << "CASE 3: " << Query(5, 5) << '\n';
//    cout << "CASE 4: " << Query(2, 4) << '\n';
//}
//
//
//signed main(){
//    setupIO();
//    int Test = 1;
////    cin >> Test;
//    for ( int i = 1 ; i <= Test ; i++ ){
//        Whisper();
//        if (i < Test) cout << '\n';
//    }
//}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 3664 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 103 ms 3672 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 107 ms 3928 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 363 ms 8328 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 384 ms 8132 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 364 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 365 ms 8264 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 364 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 382 ms 8448 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 363 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1