oj.uz

답안 #767048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767048 2023-06-26T10:39:55 Z YassineBenYounes 비밀 (JOI14_secret) C++17
100 / 100
 419 ms 8264 KB 
#include<bits/stdc++.h>
#include "secret.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pair<int, int>, null_type, less<pair<int, int>>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

const int mx = 1005;
const int LOG = 25;
const int inf = 1e9+5;
const ll mod = 1e9+7;

int range[mx][mx];

void Solve(int l, int r) {
  if (r - l <= 1) {
    return;
  }
  int md = (l + r) / 2;
  for (int i = md - 1; i >= l; --i) {
    if (range[i][md] == -1) {
      range[i][md] = Secret(range[i][i + 1], range[i + 1][md]);
    }
  }
  for (int i = md + 1; i <= r; ++i) {
    if (range[md][i] == -1) {
      range[md][i] = Secret(range[md][i - 1], range[i - 1][i]);
    }
  }
  Solve(l, md);
  Solve(md, r);
}

void Init(int N, int A[]){
    for(int i = 0; i <= N;i++){
        for(int j = 0; j <= N;j++){
            range[i][j] = -1;
        }
    }
    for(int i = 0; i < N;i++){
        range[i][i+1] = A[i];
    }
    Solve(0, N);
}

int Query(int L, int R){
    for(int i = L+1;i <= R;i++){
        if(range[L][i] != -1 && range[i][R+1] != -1){
            return Secret(range[L][i], range[i][R+1]);
        }
    }
    return range[L][R+1];
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 4372 KB Output is correct - number of calls to Secret by Init = 3084, maximum number of calls to Secret by Query = 1
2 Correct 115 ms 4376 KB Output is correct - number of calls to Secret by Init = 3092, maximum number of calls to Secret by Query = 1
3 Correct 112 ms 4408 KB Output is correct - number of calls to Secret by Init = 3101, maximum number of calls to Secret by Query = 1
4 Correct 411 ms 8200 KB Output is correct - number of calls to Secret by Init = 6989, maximum number of calls to Secret by Query = 1
5 Correct 400 ms 8172 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
6 Correct 388 ms 8216 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
7 Correct 393 ms 8216 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
8 Correct 419 ms 8212 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
9 Correct 402 ms 8128 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1
10 Correct 394 ms 8264 KB Output is correct - number of calls to Secret by Init = 6997, maximum number of calls to Secret by Query = 1