# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120509 | model_code | Strange Device (APIO19_strange_device) | C++17 | 1332 ms | 285776 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>
#define fr first
#define sc second
#define m_p make_pair
using namespace std;
typedef long long ll;
const ll llinf = 1e18;
const int maxn = 3e6 + 100, inf = 1e9 + 100;
pair<pair<ll, ll>, ll> mas[2 * maxn];
pair<pair<ll, bool>, ll> q[4 * maxn];
int szmas, szq;
ll y;
int have[2 * maxn];
void add_mas(ll l, ll r, ll w) {
mas[szmas++] = {{l, r}, w};
assert(szmas <= 2 * maxn);
}
void add_q(ll l, ll r, ll w) {
q[szq++] = {{l, 0}, w};
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |