//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include "secret.h"
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define sqrl(a) (ll(a)*ll(a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
mt19937 rnd(time(0) + 228 + 'k' + 'e' + 'k' + 'e' + 'r' + 'o' + 'f' + 'e' + 'y');
vector<int> genvec(int sz, int minelem, int maxelem)
{
++maxelem;
vector<int> ans(sz);
for (int i = 0; i < sz; ++i)
{
ans[i] = minelem + rnd() % (maxelem - minelem);
}
return ans;
}
const ld EPS = 1e-5;//(cos,-sin), (sin, cos)
bool checkprime(int x)
{
for (int i = 2; i * i <= x; ++i) if (x % i == 0) return 0;
return 1;
}
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const ll INF = 1e18;
int mod = MOD9;
const int inf = 1e9;
const int lgg = 10;
const int MAXN = 1000;
int kek[MAXN][lgg];
int tn;/*
int Secret(int x, int y)
{
return min(x + 2 * (y / 2), 1000000000);
}*/
void Init(int n, int a[])
{
tn = n;
for (int i = 0; i < n; ++i) kek[i][0] = a[i];
for (int len = 9; len >= 1; --len)
{
for (int x = (1 << len) - 1; x < n; x += (2<<len))
{
kek[x][len] = a[x];
for (int j = x -1; j >= x- (1<<len) + 1; --j)
{
kek[j][len] = Secret(a[j], kek[j+1][len]);
}
if (x + 1 < n)
{
kek[x + 1][len] = a[x + 1];
for (int j = x + 2; j <= x + (1 << len) && j < n; ++j)
{
kek[j][len] = Secret(kek[j - 1][len], a[j]);
}
}
}
}
}
int fndh;
void dfs(int h, int tl, int tr, int l, int r)
{
if (tr < l || r < tl) return;
if (tl > tr) return;
int x = (tl + tr) / 2;
if (x >= l && x <= r)
{
fndh = min(fndh, h);
return;
}
if (tl == tr) return;
dfs(h + 1, tl, x, l, r);
dfs(h + 1, tl + 1, tr, l, r);
}
int Query(int l, int r)
{
if (l == r) return kek[l][0];
if (l == r - 1)return Secret(kek[l][0], kek[r][0]);
int keka = (l ^ r);
int jj = 0;
while ((1 << jj) <= keka)++jj;
jj--;
return Secret(kek[l][jj], kek[r][jj]);
}
/*
int taaa[8];
signed main()
{
fastio();
int tnn;
cin >> tnn;
for (int i = 0; i < tnn; ++i) cin >> taaa[i];
Init(tnn, taaa);
int q;
cin >> q;
while (q--)
{
int l, r;
cin >> l >> r;
cout << Query(l, r) << endl;
}
sp;
}*/
/*
5 64
4 10 11 40 47
1 14 39 78 30
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
147 ms |
2424 KB |
Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
148 ms |
2424 KB |
Output is correct - number of calls to Secret by Init = 4097, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
146 ms |
2424 KB |
Output is correct - number of calls to Secret by Init = 4097, maximum number of calls to Secret by Query = 1 |
| 4 |
Correct |
524 ms |
4348 KB |
Output is correct - number of calls to Secret by Init = 7979, maximum number of calls to Secret by Query = 1 |
| 5 |
Correct |
549 ms |
4348 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
| 6 |
Correct |
519 ms |
4344 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
| 7 |
Correct |
520 ms |
4348 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
516 ms |
4344 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
519 ms |
4344 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
517 ms |
4344 KB |
Output is correct - number of calls to Secret by Init = 7993, maximum number of calls to Secret by Query = 1 |
