# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226482 | AQT | Election Campaign (JOI15_election_campaign) | C++14 | 248 ms | 41208 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;
struct node{
int l, r;
long long tot, lzy;
};
int N, M;
vector<int> graph[100005];
vector<pair<long long, pair<int, int>>> v[100005];
int par[20][100005];
int lft[100005], rht[100005], t=0;
node seg[1000000];
long long dp[100005];
long long tot[100005];
void pd(int idx){
if(seg[idx].lzy){
seg[2*idx].lzy += seg[idx].lzy;
seg[2*idx+1].lzy += seg[idx].lzy;
seg[2*idx].tot += seg[idx].lzy;
seg[2*idx+1].tot += seg[idx].lzy;
seg[idx].lzy = 0;
}
}
void build(int l, int r, int idx){
seg[idx].l = l, seg[idx].r = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |