# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533034 | Lobo | Secret (JOI14_secret) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 1010
int n, a[maxn], pf[maxn][30], sf[maxn][30];
int32_t Secret(int32_t X, int32_t Y) {
return (X + 2 * (Y / 2));
}
void dc(int l, int r, int lv) {
int mid = (l+r)/2;
// cout << lv << " " << l << " " << r << " " << mid << endl;
pf[mid+1][lv] = a[mid+1];
for(int i = mid+2; i <= r; i++) {
pf[i][lv] = Secret(pf[i-1][lv],a[i]);
}