#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
#include "secret.h"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM;
// x += 11400714819323198485ull;
// x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
int N;
int arr[MAXN];
int stor[MAXN][MAXN];
int ask(int x, int y)
{
return Secret(x, y);
}
void solve(int L, int R)
{
// cerr << "solve " << L << ' ' << R << endl;
if (R - L <= 1) return;
FOR(i, L + 1, R + 1)
{
if (stor[L][i] == -1) stor[L][i] = ask(stor[L][i - 1], arr[i]);
}
FORD(i, R, L + 1)
{
if (stor[i][R] == -1) stor[i][R] = ask(arr[i], stor[i + 1][R]);
}
int mid = (L + R) >> 1;
solve(L, mid);
solve(mid + 1, R);
}
void Init(int n, int A[])
{
N = n;
FOR(i, 0, N)
{
arr[i] = A[i];
}
FOR(i, 0, N)
{
FOR(j, 0, N)
{
stor[i][j] = -1;
}
stor[i][i] = arr[i];
}
solve(0, N - 1);
}
int Query(int L, int R)
{
if (stor[L][R] != -1)
{
return stor[L][R];
}
FOR(i, L, R)
{
if (stor[L][i] != -1 && stor[i + 1][R] != -1)
{
return ask(stor[L][i], stor[i + 1][R]);
}
}
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/
Compilation message
secret.cpp: In function 'int Query(int, int)':
secret.cpp:208:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
150 ms |
4472 KB |
Output is correct - number of calls to Secret by Init = 4088, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
147 ms |
4472 KB |
Output is correct - number of calls to Secret by Init = 4097, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
155 ms |
4628 KB |
Output is correct - number of calls to Secret by Init = 4107, maximum number of calls to Secret by Query = 1 |
| 4 |
Incorrect |
531 ms |
8544 KB |
Output isn't correct - number of calls to Secret by Init = 8967, maximum number of calls to Secret by Query = 1 |
| 5 |
Incorrect |
526 ms |
8452 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
| 6 |
Incorrect |
529 ms |
8448 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
| 7 |
Incorrect |
559 ms |
8312 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
| 8 |
Incorrect |
544 ms |
8444 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
| 9 |
Incorrect |
540 ms |
8480 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
| 10 |
Incorrect |
581 ms |
8312 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
