# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413376 | ritul_kr_singh | Election Campaign (JOI15_election_campaign) | C++17 | 260 ms | 41456 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 int long long
#define sp << ' ' <<
#define nl << '\n'
const int LIM = 1e5;
struct FenwickTree{
vector<int> a; int n, s;
void init(int N){ a.resize((n=N)+1); }
void add(int i, int v){
for(++i; i<=n; i+=i&-i) a[i] += v;
}
int get(int i){
s = 0;
for(++i; i>=1; i-=i&-i) s += a[i];
return s;
}
} f;
int n, m, t0[LIM], t1[LIM], s[LIM], dp[LIM], dfsTimer = 0;
array<int, 3> a[LIM];
array<int, 18> p[LIM];
vector<int> g[LIM], q[LIM];
void dfs0(int u, int par){
p[u][0] = par;
for(int i=0; i<17; ++i) p[u][i+1] = p[p[u][i]][i];
# | 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... |