# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706145 | LittleCube | Road Construction (JOI21_road_construction) | C++14 | 8968 ms | 77384 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.
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;
ll N, K, bit[750005];
pll p[250005], pp[250005];
void modify(int pos, int val)
{
for (int i = pos; i <= 3 * N; i += (i & -i))
bit[i] += val;
}
ll query(int pos)
{
ll val = 0;
for (int i = pos; i > 0; i -= (i & -i))
val += bit[i];
return val;
}
ll calc(ll L)
{
vector<tuple<ll, int, int, int>> v;
vector<ll> vy;
v.reserve(3 * N);
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... |