# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
507739 | couplefire | Constellation 3 (JOI20_constellation3) | C++17 | 460 ms | 106584 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;
#define ll long long
const int N = 200005;
int n, m, arr[N], st[N][20], lg[N];
vector<int> pos[N];
int vv[N], dep[N], top, up[N][20], rt;
ll dp[N], bit[N], sum[N];
int tin[N], tout[N], tid;
vector<int> adj[N];
vector<pair<int, int>> stuff[N];
void update(int i, ll x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
ll query(int i) {
ll ret = 0;
while (i) {
ret += bit[i];
i -= i & -i;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |