oj.uz

Submission #550140

# Submission time Handle Problem Language Result Execution time Memory
550140 2022-04-17T10:54:22 Z Bungmint Training (IOI07_training) C++17
100 / 100
 15 ms 4408 KB 
//Copyright © 2022 Youngmin Park. All rights reserved.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
using vpi = vector<pii>;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pll>;
using ld = long double;
template <typename T, size_t SZ>
using ar = array<T, SZ>;

#define all(v) (v).begin(), (v).end()
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define REP(a) F0R(_, a)

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7; //998244353;
const ld PI = acos((ld)-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <typename T>
bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; }

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
    return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v)
{
    os << '{';
    string sep;
    for (const T &x : v)
        os << sep << x, sep = ", ";
    return os << '}';
}
void dbg_out()
{
    cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T)
{
    cerr << ' ' << H;
    dbg_out(T...);
}
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

inline namespace RecursiveLambda{
	template <typename Fun>
	struct y_combinator_result{
		Fun fun_;
		template <typename T> 
		explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){}
		template <typename...Args>
		decltype(auto) operator()(Args &&...args){
			return fun_(ref(*this), forward<Args>(args)...);
		}
	};
	template <typename Fun>
	decltype(auto) y_combinator(Fun &&fun){
		return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun));
	}
};

void setIO(string s) // USACO
{
	#ifndef LOCAL
	    freopen((s + ".in").c_str(), "r", stdin);
	    freopen((s + ".out").c_str(), "w", stdout);
	#endif
}

const int N = 5000;
int tin[N], tout[N], timer, deg[N];
pii p[N];
int dp[N][1 << 10];
vi adj[N];
bool dep[N];
struct Edge {
	int u, v, lca, cost;
	bool operator<(const Edge& o) const {
		return tout[lca] < tout[o.lca];
	}
};
vector<Edge> edges;
void dfs(int u = 0, int pu = -1) {
	if (~pu) dep[u] = !dep[pu];
	tin[u] = ++timer;
	for (auto &v : adj[u]) {
		if (v == pu) continue;
		p[v] = {u, 1 << (deg[u]++)};
		dfs(v, u);
	}
	tout[u] = ++timer;
}
bool anc(int u, int v) {
	return (tin[u] <= tin[v] && tout[v] <= tout[u]);
}
int calc_lca(int u, int v) {
	while (!anc(u, v)) u = p[u].fi;
	return u;
}


void solve()
{
	int n, m;
	cin >> n >> m;
	int totC = 0;
	F0R(i, m) {
		int u, v, cost;
		cin >> u >> v >> cost;
		u--, v--;
		totC += cost;
		if (cost == 0) {
			adj[u].pb(v), adj[v].pb(u);
		}
		edges.pb({u, v, 0, cost});
	}
	dfs();
	for (auto &[u, v, lca, cost] : edges) lca = calc_lca(u, v);
	sort(all(edges));
	for (auto &[u, v, lca, cost] : edges) {
		if (cost && ((dep[u] ^ dep[v]))) continue;
		int sum = cost;
		pii U = {u, 0}, V = {v, 0};
		for (; U.fi != lca; U = p[U.fi]) sum += dp[U.fi][U.se];
		for (; V.fi != lca; V = p[V.fi]) sum += dp[V.fi][V.se];
		R0F(mask, 1 << deg[lca]) {
			if ((mask & (U.se)) || (mask & V.se)) continue;
			ckmax(dp[lca][mask], sum + dp[lca][mask | V.se | U.se]);

		}
	}
	cout << totC - dp[0][0] << '\n';
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int testcase=1;
    // cin >> testcase;
    while (testcase--)
    {
        solve();
    }
}

Compilation message

training.cpp: In function 'void setIO(std::string)':
training.cpp:94:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
training.cpp:95:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4308 KB Output is correct
2 Correct 8 ms 4408 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 604 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 452 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 596 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1036 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 3 ms 980 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 3 ms 1108 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 4 ms 1364 KB Output is correct
3 Correct 12 ms 792 KB Output is correct
4 Correct 3 ms 852 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 972 KB Output is correct
2 Correct 15 ms 1908 KB Output is correct
3 Correct 6 ms 1104 KB Output is correct
4 Correct 7 ms 1492 KB Output is correct