# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132856 | doowey | Cake 3 (JOI19_cake3) | C++14 | 1562 ms | 20456 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("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)2e5 + 9;
const ll inf = (ll)1e18;
vector<ll> best;
ll c[N];
ll v[N];
int m;
struct Node{
ll cnt;
ll sum;
};
Node T[N * 4 + 512];
int k;
void update(int node, int cl, int cr, int p, ll v){
T[node].cnt += v;
T[node].sum += v * 1ll * best[p];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |