# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970880 | Beerus13 | Election Campaign (JOI15_election_campaign) | C++14 | 89 ms | 40432 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 long long
const int N = 1e5 + 5;
const int K = 17;
bool maximize(auto &a, auto b) {
if(a >= b) return true;
a = b;
false;
}
int n, m, numDFS;
int dep[N], P[N][K], in[N], out[N];
int dp[N], f[N], bit[N];
vector<int> g[N];
vector<tuple<int, int, int>> plans[N];
void update(int i, int val) {
for(; i <= n; i += i & -i) bit[i] += val;
}
void update(int l, int r, int val) {
update(l, val);
update(r + 1, -val);
}
int get(int i) {
int res = 0;
for(; i; i -= i & -i) res += bit[i];
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... |