# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129006 | wilwxk | Cake 3 (JOI19_cake3) | C++14 | 1501 ms | 204956 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;
struct node {
ll v, s;
int l, r;
};
const int MAXN=2e5+5;
const int MAIOR=1e9+3;
const ll INF=1e18+9;
pair<ll, ll> v[MAXN]; //c, v
vector<node> seg;
ll dp[MAXN];
int opt[MAXN], raiz[MAXN];
int n, m;
int novo() {
node cur;
cur.l=cur.r=cur.v=cur.s=0;
seg.push_back(cur);
return seg.size()-1;
}
int update(int sind, int ini, int fim, int qind) {
int nsind=novo(); seg[nsind]=seg[sind];
if(ini==fim) {
seg[nsind].v++;
seg[nsind].s+=ini;
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... |