# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
785001 | tvladm2009 | Election Campaign (JOI15_election_campaign) | C++17 | 144 ms | 30892 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;
typedef long long ll;
const int N = (int) 1e5 + 7;
const int K = 17;
int n;
int m;
vector<int> g[N];
int tab[K][N];
int tin[N];
int tout[N];
int depth[N];
ll sum[N];
ll dp[N];
int t = 0;
struct Offer {
int x;
int y;
int cost;
};
vector<Offer> offers[N];
void dfs(int a, int p = 0) {
tin[a] = ++t;
depth[a] = depth[p] + 1;
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... |