# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114064 | popovicirobert | Long Mansion (JOI17_long_mansion) | C++14 | 1434 ms | 112424 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>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
vector <char> lg;
inline int get_mx(int x, int y, vector < vector <int> > &rmq, vector <int> &arr) {
int bit = lg[y - x + 1];
return max(arr[rmq[x][bit]], arr[rmq[y - (1 << bit) + 1][bit]]);
}
inline int get_mn(int x, int y, vector < vector <int> > &rmq, vector <int> &arr) {
int bit = lg[y - x + 1];
return min(arr[rmq[x][bit]], arr[rmq[y - (1 << bit) + 1][bit]]);
}
vector <bool> sol;
int n, q;
inline void solve(vector <int> &c, vector < vector <int> > &key, vector < pair <int, int> > &qry) {
vector <int> last(n + 1, -1), prv(n + 1, -1), nxt(n + 1, n + 1);
int i;
for(i = 1; i < n; i++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |