# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767732 | PurpleCrayon | Tourism (JOI23_tourism) | C++17 | 668 ms | 61844 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 sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 1e5+10, MOD = 1e9+7;
const int L = 19;
struct FT {
vector<int> bit;
FT(int n): bit(n) {}
void upd(int i, int x) {
for (; i < sz(bit); i |= i+1) bit[i] += x;
}
int qry(int i) {
int ans = 0;
for (++i; i > 0; i &= i-1) ans += bit[i-1];
return ans;
}
};
int n, m, q, st[N], en[N], depth[N], tt = 0;
vector<int> adj[N];
vector<int> lca_et;
int sparse[2 * N][L], st_lca[N], en_lca[N];
# | 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... |