# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102390 | Alexa2001 | Election Campaign (JOI15_election_campaign) | C++17 | 416 ms | 28800 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;
/// 17:03
const int Nmax = 1e5 + 5, lg = 18;
typedef long long ll;
int n, t[lg+2][Nmax], level[Nmax], In[Nmax], Out[Nmax], tmp;
ll sum[Nmax], dp[Nmax];
struct Plan
{
int x, y, c;
};
vector<int> v[Nmax];
vector<Plan> plan[Nmax];
class AIB
{
ll a[Nmax];
int ub(int x) { return (x&(-x)); }
public:
void update(int x, int y, ll val)
{
for(; x<=n; x+=ub(x)) a[x] += val;
# | 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... |