# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216895 | eriksuenderhauf | Treatment Project (JOI20_treatment) | C++11 | 385 ms | 32344 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("O3")
#include <bits/stdc++.h>
#define pii pair<int, int>
#define pb push_back
#define st first
#define nd second
#define ar(n) array<ll,(n)>
using namespace std;
typedef long long ll;
const ll inf = 1e16 + 7;
const int M = 200005;
ar(4) a[M], b[M];
priority_queue<ar(2), vector<ar(2)>, greater<ar(2)>> pq;
ll n, m, t=1, dp[M];
vector<pii> seg[M];
int vis[M];
void setE(int idx, int i, int j) {
for (++i; i < M; i += i & -i)
seg[i].pb({j, idx});
}
void updE(int i, int j, ll v) {
for (++i; i > 0; i -= i & -i) {
while (!seg[i].empty()) {
int k = seg[i].back().nd;
if (vis[k]) {
seg[i].pop_back();
continue;
}
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... |