# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603278 | AdamGS | Feast (NOI19_feast) | C++17 | 179 ms | 120688 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;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
struct Node {
ll pref;
int ind_pref;
ll inv_pref;
int inv_ind_pref;
ll suf;
int ind_suf;
ll inv_suf;
int inv_ind_suf;
ll psoms;
int indl_psoms, indr_psoms;
ll inv_psoms;
int inv_indl_psoms, inv_indr_psoms;
ll sum;
int lazy;
};
const int LIM=1<<20, INF=1e9+7;
ll T[LIM], N=1, n, k;
Node tr[2*LIM], pusty;
void inv(int v) {
swap(tr[v].pref, tr[v].inv_pref);
# | 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... |