# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847444 | qwerasdfzxcl | Mizuyokan 2 (JOI23_mizuyokan2) | C++17 | 850 ms | 229560 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;
typedef long long ll;
constexpr int INF1 = 1e9 + 100;
int n;
int a[250250];
int go[250250], sp[250250][20];
ll S[250250];
struct Node{
array<int, 2> f[51];
int pos, sz;
Node(){}
Node(int _pos, int nxt){
f[0] = {nxt, 1};
pos = _pos;
sz = 1;
}
};
array<int, 2> operator + (const array<int, 2> &x, int y){
return {x[0], x[1]+y};
}
void merge(Node &P, const Node &L, const Node &R){
Compilation message (stderr)
# | 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... |