oj.uz

Submission #853656

# Submission time Handle Problem Language Result Execution time Memory
853656 2023-09-25T00:21:20 Z NK_ Tug of War (BOI15_tug) C++17
0 / 100
 8 ms 4952 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 18;

const int nax = 3e4 + 5;
const int kax = 20;
const int ZERO = nax * kax;
using B = bitset<2 * ZERO>;
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
 
	int N, K; cin >> N >> K;
	int M = N; N += N;

	vi deg(N); vi W(N);
	V<vpi> adj(N); for(int i = 0; i < N; i++) {
		int u, v, w; cin >> u >> v >> w; --u, --v, v += M;
		W[i] = w;
		adj[u].pb(mp(v, i));
		adj[v].pb(mp(u, i));
		deg[u]++, deg[v]++;
	}

	queue<int> q; for(int i = 0; i < N; i++) {
		if (deg[i] == 1) q.push(i);
	}

	vi used(N), vis(N), C(N); int BAL = 0;
	while(sz(q)) {
		int u = q.front(); q.pop();

		vis[u] = 1;

		int t = 0;
		for(auto& e : adj[u]) {
			auto [v, i] = e;

			if (used[i]) continue;
			used[i] = 1; ++t;

			deg[v]--;
			if (deg[v] == 0) q.push(v);

			C[v] += W[i] - C[u];
		}	

		assert(t == 1);
	}

	for(int i = 0; i < N; i++) {
		if (deg[i] == 0) continue;
		if (deg[i] != 2) {
			cout << "NO" << nl;
			exit(0-0);
		}
	}

	int bal = 0;
	function<void(int, int)> dfs = [&](int u, int d) {
		vis[u] = 1;
		for(auto& e : adj[u]) {
			auto [v, i] = e;
			if (used[i]) continue;
			// cout << d << endl;
			bal += d * W[i];
			// cout << u << " -> " << v << " C " << W[i] << endl;
			used[i] = 1; dfs(v, -d);
		}
	};

	vi X;
	for(int u = 0; u < N; u++) if (!vis[u]) {
		X.pb(abs(C[u]));
		bal = 0; dfs(u, 1); X.pb(abs(bal));
		// cout << bal << endl << endl;
	}

	B dp; dp[ZERO - BAL] = dp[ZERO + BAL] = 1;
	for(auto x : X) if (x) {
		// cout << x << endl;
		dp = (dp << x) | (dp >> x);
	}

	for(int x = 0; x < 2*ZERO; x++) if (dp[x]) {
		// cout << x << endl;
		if (abs(x - ZERO) <= K) {
			cout << "YES" << nl;
			exit(0-0);
		}
	}

	cout << "NO" << nl;

	exit(0-0);
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1328 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1112 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 2 ms 1112 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 2 ms 1112 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 2 ms 1112 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 2 ms 1112 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Incorrect 1 ms 856 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1328 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1112 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 2 ms 1112 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 2 ms 1112 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 2 ms 1112 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 2 ms 1112 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Incorrect 1 ms 856 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2648 KB Output is correct
2 Runtime error 8 ms 4952 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1328 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 2 ms 1112 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 2 ms 1112 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 2 ms 1112 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 2 ms 1372 KB Output is correct
18 Correct 2 ms 1112 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 2 ms 1112 KB Output is correct
21 Correct 1 ms 856 KB Output is correct
22 Incorrect 1 ms 856 KB Output isn't correct
23 Halted 0 ms 0 KB -