# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128497 | Lawliet | Cake 3 (JOI19_cake3) | C++14 | 1676 ms | 129920 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 MAX 200010
#define MAXV 1000000010
#define INF 1000000000000000000LL
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
class PersistentSegmentTree
{
public:
void copy(int node)
{
e.push_back( e[node] );
d.push_back( d[node] );
qtd.push_back( qtd[node] );
sum.push_back( sum[node] );
}
int update(int node, int l, int r, int i)
{
int newNode = ++curNode;
copy( node );
if(l == r)
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... |