# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102696 | tincamatei | Election Campaign (JOI15_election_campaign) | C++14 | 249 ms | 30424 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;
const int MAX_N = 100000;
const int MAX_M = 100000;
const int INF = 1000000000;
vector<int> graph[1+MAX_N];
vector<int> chainstart[1+MAX_N];
int dp[1+MAX_N], subarb[1+MAX_N], cost[MAX_N];
void calcSubarb(int nod, int papa = 0) {
subarb[nod] = chainstart[nod].size();
for(auto it: graph[nod])
if(it != papa) {
calcSubarb(it, nod);
subarb[nod] += subarb[it];
}
}
struct NodeCell {
static int bestCost[1+MAX_N];
static bool nodeExists[1+MAX_N];
static int lazy;
vector<pair<int, int> > chains;
static void init() {
for(int i = 0; i <= MAX_N; ++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... |