# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553275 | cadmiumsky | 비밀 (JOI14_secret) | C++14 | 481 ms | 4564 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 "secret.h"
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e3 + 5;
vector<int> v;
namespace RMQ {
int atr[nmax];
int rmq[12][nmax];
void color(int l, int r, int bit = 0) {
//cerr << l << ' ' << r << ' ' << bit << '\n';
if(l + 1 >= r) {
while(l <= r)
atr[l] = bit, l++;
return;
}
int mid = l + r >> 1;
atr[mid] = atr[mid + 1] = bit;
color(l, mid - 1, bit + 1);
color(mid + 2, r, bit + 1);
rmq[bit][mid] = v[mid];
rmq[bit][mid + 1] = v[mid + 1];
for(int i = mid - 1; i >= l; i--)
rmq[bit][i] = Secret(v[i], rmq[bit][i + 1]);
for(int i = mid + 2; i <= r; i++)
rmq[bit][i] = Secret(rmq[bit][i - 1], v[i]);
return;
}
namespace IRMQ {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |