oj.uz

Submission #752728

# Submission time Handle Problem Language Result Execution time Memory
752728 2023-06-03T13:41:14 Z GrindMachine Tug of War (BOI15_tug) C++17
100 / 100
 2112 ms 7984 KB 
// Om Namah Shivaya

#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://github.com/tmwilliamlin168/CompetitiveProgramming/blob/master/BtOI/15-Tug.cpp
https://github.com/nikolapesic2802/Programming-Practice/blob/master/Tug%20of%20War/main.cpp

*/

const int MOD = 1e9 + 7;
const int N = 3e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<array<ll,3>> adj[N*2];

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> deg(2*n+5);

    rep1(i,2*n){
        ll u,v,w; cin >> u >> v >> w;
        v += n;
        adj[u].pb({v,w,i});
        adj[v].pb({u,w,i});
        deg[u]++, deg[v]++;
    }

    queue<ll> q;
    vector<bool> vis_node(2*n+5), vis_edge(2*n+5);

    rep1(i,2*n){
        if(deg[i] < 2){
            q.push(i);
        }
    }

    ll diff = 0;

    while(!q.empty()){
        ll u = q.front();
        q.pop();
    
        vis_node[u] = 1;

        if(!deg[u]){
            no;
            return;
        }

        for(auto [v, w, id] : adj[u]){
            if(vis_edge[id]) conts;
            vis_edge[id] = 1;
            deg[v]--;

            if(deg[v] < 2){
                q.push(v);
            }

            if(u <= n) diff += w;
            else diff -= w;
        }
    }

    rep1(u,2*n){
        if(vis_node[u]) conts;
        vector<array<ll,3>> good;

        for(auto [v, w, id] : adj[u]){
            if(vis_node[v]) conts;
            good.pb({v,w,id});
        }

        assert(sz(good) == 2);
        adj[u] = good;
    }

    vector<ll> vals;

    rep1(u,2*n){
        if(vis_node[u]) conts;

        vector<ll> weights;
        ll ptr = u;
        ll prev_id = -1;

        while(true){
            if(ptr == u and prev_id != -1){
                break;
            }

            vis_node[ptr] = 1;

            for(auto [v, w, id] : adj[ptr]){
                if(id == prev_id) conts;
                weights.pb(w);
                ptr = v;
                prev_id = id;
                break;
            }
        }

        ll val = 0;
        rep(i,sz(weights)){
            ll c = -1;
            if(!(i & 1)) c = 1;
            val += c * weights[i];
        }

        val = abs(val);
        vals.pb(val);
    }

    bitset<40*N> dp;
    dp[20*N] = 1;

    trav(x,vals){
        dp = (dp << x) | (dp >> x);
    }

    rep(i,40*N){
        if(dp[i]){
            ll d = i - 20*N;
            ll diff2 = diff + d;
            if(abs(diff2) <= k){
                yes;
                return;
            }
        }
    }

    no;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

tug.cpp: In function 'void solve(int)':
tug.cpp:33:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 | #define rep(i, n) for(int i = 0; i < n; ++i)
      |                                    ^
tug.cpp:157:9: note: in expansion of macro 'rep'
  157 |         rep(i,sz(weights)){
      |         ^~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2260 KB Output is correct
3 Correct 3 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2260 KB Output is correct
7 Correct 3 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2260 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 4 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 2 ms 2260 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 4 ms 2260 KB Output is correct
21 Correct 2 ms 2260 KB Output is correct
22 Correct 2 ms 2260 KB Output is correct
23 Correct 3 ms 2260 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 3 ms 2316 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2260 KB Output is correct
3 Correct 3 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2260 KB Output is correct
7 Correct 3 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2260 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 4 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 2 ms 2260 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 4 ms 2260 KB Output is correct
21 Correct 2 ms 2260 KB Output is correct
22 Correct 2 ms 2260 KB Output is correct
23 Correct 3 ms 2260 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 3 ms 2316 KB Output is correct
26 Correct 117 ms 2652 KB Output is correct
27 Correct 19 ms 2664 KB Output is correct
28 Correct 130 ms 2648 KB Output is correct
29 Correct 19 ms 2664 KB Output is correct
30 Correct 116 ms 2656 KB Output is correct
31 Correct 23 ms 2644 KB Output is correct
32 Correct 134 ms 2648 KB Output is correct
33 Correct 19 ms 2664 KB Output is correct
34 Correct 11 ms 2644 KB Output is correct
35 Correct 18 ms 2644 KB Output is correct
36 Correct 141 ms 2652 KB Output is correct
37 Correct 18 ms 2644 KB Output is correct
38 Correct 129 ms 2656 KB Output is correct
39 Correct 20 ms 2644 KB Output is correct
40 Correct 108 ms 2652 KB Output is correct
41 Correct 19 ms 2668 KB Output is correct
42 Correct 109 ms 2764 KB Output is correct
43 Correct 19 ms 2644 KB Output is correct
44 Correct 115 ms 2648 KB Output is correct
45 Correct 19 ms 2668 KB Output is correct
46 Correct 110 ms 2644 KB Output is correct
47 Correct 2 ms 2516 KB Output is correct
48 Correct 58 ms 2620 KB Output is correct
49 Correct 60 ms 2620 KB Output is correct
50 Correct 108 ms 2644 KB Output is correct
51 Correct 124 ms 2764 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 425 ms 3972 KB Output is correct
2 Correct 11 ms 3924 KB Output is correct
3 Correct 387 ms 3968 KB Output is correct
4 Correct 9 ms 3924 KB Output is correct
5 Correct 400 ms 3968 KB Output is correct
6 Correct 9 ms 3924 KB Output is correct
7 Correct 358 ms 3976 KB Output is correct
8 Correct 10 ms 3924 KB Output is correct
9 Correct 389 ms 3976 KB Output is correct
10 Correct 9 ms 3904 KB Output is correct
11 Correct 397 ms 3976 KB Output is correct
12 Correct 12 ms 3924 KB Output is correct
13 Correct 409 ms 3984 KB Output is correct
14 Correct 398 ms 3924 KB Output is correct
15 Correct 8 ms 3924 KB Output is correct
16 Correct 420 ms 3960 KB Output is correct
17 Correct 10 ms 3924 KB Output is correct
18 Correct 391 ms 3972 KB Output is correct
19 Correct 12 ms 3924 KB Output is correct
20 Correct 398 ms 3972 KB Output is correct
21 Correct 9 ms 3796 KB Output is correct
22 Correct 193 ms 3964 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2260 KB Output is correct
3 Correct 3 ms 2260 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2260 KB Output is correct
7 Correct 3 ms 2260 KB Output is correct
8 Correct 2 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2260 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 4 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 2 ms 2260 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 4 ms 2260 KB Output is correct
21 Correct 2 ms 2260 KB Output is correct
22 Correct 2 ms 2260 KB Output is correct
23 Correct 3 ms 2260 KB Output is correct
24 Correct 3 ms 2260 KB Output is correct
25 Correct 3 ms 2316 KB Output is correct
26 Correct 117 ms 2652 KB Output is correct
27 Correct 19 ms 2664 KB Output is correct
28 Correct 130 ms 2648 KB Output is correct
29 Correct 19 ms 2664 KB Output is correct
30 Correct 116 ms 2656 KB Output is correct
31 Correct 23 ms 2644 KB Output is correct
32 Correct 134 ms 2648 KB Output is correct
33 Correct 19 ms 2664 KB Output is correct
34 Correct 11 ms 2644 KB Output is correct
35 Correct 18 ms 2644 KB Output is correct
36 Correct 141 ms 2652 KB Output is correct
37 Correct 18 ms 2644 KB Output is correct
38 Correct 129 ms 2656 KB Output is correct
39 Correct 20 ms 2644 KB Output is correct
40 Correct 108 ms 2652 KB Output is correct
41 Correct 19 ms 2668 KB Output is correct
42 Correct 109 ms 2764 KB Output is correct
43 Correct 19 ms 2644 KB Output is correct
44 Correct 115 ms 2648 KB Output is correct
45 Correct 19 ms 2668 KB Output is correct
46 Correct 110 ms 2644 KB Output is correct
47 Correct 2 ms 2516 KB Output is correct
48 Correct 58 ms 2620 KB Output is correct
49 Correct 60 ms 2620 KB Output is correct
50 Correct 108 ms 2644 KB Output is correct
51 Correct 124 ms 2764 KB Output is correct
52 Correct 425 ms 3972 KB Output is correct
53 Correct 11 ms 3924 KB Output is correct
54 Correct 387 ms 3968 KB Output is correct
55 Correct 9 ms 3924 KB Output is correct
56 Correct 400 ms 3968 KB Output is correct
57 Correct 9 ms 3924 KB Output is correct
58 Correct 358 ms 3976 KB Output is correct
59 Correct 10 ms 3924 KB Output is correct
60 Correct 389 ms 3976 KB Output is correct
61 Correct 9 ms 3904 KB Output is correct
62 Correct 397 ms 3976 KB Output is correct
63 Correct 12 ms 3924 KB Output is correct
64 Correct 409 ms 3984 KB Output is correct
65 Correct 398 ms 3924 KB Output is correct
66 Correct 8 ms 3924 KB Output is correct
67 Correct 420 ms 3960 KB Output is correct
68 Correct 10 ms 3924 KB Output is correct
69 Correct 391 ms 3972 KB Output is correct
70 Correct 12 ms 3924 KB Output is correct
71 Correct 398 ms 3972 KB Output is correct
72 Correct 9 ms 3796 KB Output is correct
73 Correct 193 ms 3964 KB Output is correct
74 Correct 1774 ms 6964 KB Output is correct
75 Correct 105 ms 7468 KB Output is correct
76 Correct 1662 ms 7780 KB Output is correct
77 Correct 107 ms 7492 KB Output is correct
78 Correct 1692 ms 7776 KB Output is correct
79 Correct 1643 ms 7780 KB Output is correct
80 Correct 111 ms 7520 KB Output is correct
81 Correct 107 ms 7528 KB Output is correct
82 Correct 1670 ms 7764 KB Output is correct
83 Correct 1858 ms 7784 KB Output is correct
84 Correct 107 ms 7500 KB Output is correct
85 Correct 2009 ms 7776 KB Output is correct
86 Correct 109 ms 7520 KB Output is correct
87 Correct 1980 ms 7780 KB Output is correct
88 Correct 123 ms 7496 KB Output is correct
89 Correct 2112 ms 7780 KB Output is correct
90 Correct 149 ms 7448 KB Output is correct
91 Correct 2059 ms 7800 KB Output is correct
92 Correct 131 ms 7500 KB Output is correct
93 Correct 2019 ms 7788 KB Output is correct
94 Correct 42 ms 7764 KB Output is correct
95 Correct 1039 ms 7944 KB Output is correct
96 Correct 989 ms 7984 KB Output is correct
97 Correct 1845 ms 7836 KB Output is correct
98 Correct 2093 ms 7796 KB Output is correct