# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1046616 | GusterGoose27 | Mizuyokan 2 (JOI23_mizuyokan2) | C++17 | 241 ms | 166420 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 int MAXN = 25e4+5;
const int MAXB = 18;
int arr[MAXN];
int Arr[MAXN];
typedef long long ll;
ll pre[MAXN];
int n, q;
ll sum(int l, int r) {
return pre[r+1] - pre[l];
}
int dp[MAXN];
vector<int> to_activate[MAXN];
typedef array<int, 2> ar2;
ar2 nxt[MAXN][MAXB];
int sjump[MAXN][MAXB];
int spos[MAXN];
int tmx[2*MAXN];
void reset() {
fill(tmx, tmx+2*n+2, -1);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |