# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960715 | pcc | Election Campaign (JOI15_election_campaign) | C++17 | 89 ms | 32108 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;
#define ll int
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("popcnt,sse4,avx2")
const int mxn = 1e5+10;
int N,Q,rt;
vector<int> tree[mxn];
vector<pair<pii,int>> req[mxn];
namespace HLD{
int idx[mxn],link_top[mxn],par[mxn],dep[mxn],bs[mxn],sz[mxn];
ll bit[mxn];
bitset<mxn> done;
void modify(int p,ll v){
done[p] = true;
bit[p] = bit[p+1]+v;
return;
/*
for(;p<mxn;p+=p&-p)bit[p] += v;
return;
# | 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... |