# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872215 | serifefedartar | Election Campaign (JOI15_election_campaign) | C++17 | 91 ms | 42544 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 fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+9;
const ll LOGN = 20;
const ll MAXN = 1e5 + 100;
vector<vector<int>> graph;
vector<pair<pair<int,int>, int>> plan[MAXN];
int tin[MAXN], tout[MAXN], T = 0;
int up[LOGN][MAXN], depth[MAXN], dp[MAXN];
int fen_node[MAXN], fen_subs[MAXN];
int get_node(int k) {
int res = 0;
while (k > 0) {
res += fen_node[k];
k -= k & -k;
}
return res;
}
int get_subs(int k) {
int res = 0;
while (k > 0) {
res += fen_subs[k];
k -= k & -k;
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... |