# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362909 | Lam_lai_cuoc_doi | Cake 3 (JOI19_cake3) | C++17 | 3108 ms | 19948 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;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const bool typetest = 0;
const int N = 2e5 + 5;
const ll Inf = 1e17;
struct Pakage
{
int c;
ll v;
bool operator<(const Pakage &a) const
{
return c < a.c;
}
} a[N];
int n, m, id[N], now[N];
ll dp[N], ans(0);
struct node
{
int v;
ll sum;
node()
{
v = sum = 0;
}
void combine(const node &a, const node &b)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |