Submission #1181830

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181830		Mher777	Tug of War (BOI15_tug)	C++20	0 / 100	3095 ms	5444 KiB

tug

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return 0;
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 60005;
int used[N];
multiset<pii> g[N];
int n, k, gr1, sum, gr2;
bool ok = true;
bitset<N * 10> dp;

pii dfs(int u, int type = 1) {
    used[u] = 1;
    pii ret = { 0,0 };
    pii opt = *g[u].begin();
    g[u].erase(g[u].begin());
    int to = opt.ff, s = opt.ss;
    g[to].erase(g[to].find({ u,s }));
    if (!g[to].empty()) {
        ret = dfs(to, type ^ 1);
    }
    if (type) ret.ff += s;
    else ret.ss += s;
    return ret;
}

void slv() {
    cin >> n >> k;
    for (int i = 1; i <= 2 * n; ++i) {
        int x, y, s;
        cin >> x >> y >> s;
        sum += s;
        y += n;
        g[x].insert({ y,s });
        g[y].insert({ x,s });
    }
    queue<int> q;
    for (int i = 1; i <= n; ++i) {
        if ((int)g[i].size() == 1) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int u = q.front();
        used[u] = 1;
        q.pop();
        int node = (*g[u].begin()).ff;
        int s = (*g[u].begin()).ss;
        if (u <= n) gr1 += s;
        else gr2 += s;
        g[u].clear();
        g[node].erase(g[node].find({ u,s }));
        if ((int)g[node].size() == 1) {
            q.push(node);
        }
    }
    vi v;
    int init = min(gr1, gr2);
    for (int u = 1; u <= n; ++u) {
        if (used[u]) continue;
        pii opt = dfs(u);
        if (opt.ss < opt.ff) swap(opt.ff, opt.ss);
        init += opt.ff;
        v.pub(opt.ss - opt.ff);
    }
    if (!ok) {
        no;
        return;
    }
    dp[init] = 1;
    for (auto elem : v) {
        dp |= (dp << elem);
    }
    for (int i = sum / 2; sum - 2 * i <= k; --i) {
        if (dp[i]) {
            yes;
            return;
        }
    }
    no;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 23
• Subtask 4: 0 / 29