#include "campaign.h"
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pf push_front
#define pb2 pop_back
#define pf2 pop_front
#define line printf("\n")
#define pq priority_queue
#define rep(k,i,j) for(int k = (int)i;k<(int)j;k++)
#define repd(k,i,j) for(int k = (int)i;k>=(int)j;k--)
#define ll long long
#define ALL(a) a.begin(),a.end()
#define vi vector<int>
using namespace std;
int INF = 1e9+7;
const int MAXN = 1e5 + 1;
#define vvi vector<vi>
int N, M;
vi A, B, C;
vvi adj;
vvi path;
void bfs(int u, int v, vi &path) {
vi par(N, -1);
queue<int> q;
q.push(u); par[u] = u;
while (q.size()) {
int a = q.front(); q.pop();
for (int b : adj[a]) if (par[b] == -1) {
q.push(b);
par[b] = a;
}
}
for (int b = v, a = par[v]; b != u; b = par[b], a = par[a]) {
path.pb(b);
}
path.pb(u);
}
void read(int _N, int _M, vi U, vi V, vi _A, vi _B, vi _C) {
tie(N, M, A, B, C) = {_N, _M, _A, _B, _C};
adj.resize(N);
rep(k, 0, N - 1) {
U[k]--; V[k]--;
adj[U[k]].pb(V[k]);
adj[V[k]].pb(U[k]);
}
rep(k, 0, M) {
A[k]--; B[k]--;
}
}
int getMaximumVotes(int _N, int _M, vi _U, vi _V, vi _A, vi _B, vi _C) {
read(_N, _M, _U, _V, _A, _B, _C);
path.resize(M);
vector<bitset<MAXN>> path_mask(M);
rep(k, 0, M) {
bfs(A[k], B[k], path[k]);
for (auto x : path[k])
path_mask[k][x] = 1;
}
vvi can(N, vi(N));
rep(k, 0, M) rep(i, 0, M) {
if ((path_mask[k] & path_mask[i]).any())
can[k][i] = 0;
else
can[k][i] = 1;
}
int ans = 0;
rep(mask, 0, 1 << M) {
bool ok = true;
int val = 0;
vi cur;
rep(i, 0, M) if ((1 << i) & mask) {
cur.pb(i); val += C[i];
}
for (auto a : cur) for (auto b : cur) if (a != b) {
if (!can[a][b])
ok = false;
}
if (ok)
ans = max(ans, val);
}
return ans;
}
Compilation message
election_campaign.cpp:1:10: fatal error: campaign.h: No such file or directory
#include "campaign.h"
^~~~~~~~~~~~
compilation terminated.
