oj.uz

답안 #752727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752727 2023-06-03T13:39:13 Z GrindMachine Tug of War (BOI15_tug) C++17
71 / 100
 3000 ms 8240 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 = 6e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

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

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});
        }

        if(sz(good) != 2){
            exit(101);
        }

        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:160:9: note: in expansion of macro 'rep'
  160 |         rep(i,sz(weights)){
      |         ^~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2908 KB Output is correct
2 Correct 3 ms 2900 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 2900 KB Output is correct
6 Correct 4 ms 2900 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 5 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 3 ms 2900 KB Output is correct
12 Correct 3 ms 2900 KB Output is correct
13 Correct 3 ms 2900 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 4 ms 2900 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 3 ms 2900 KB Output is correct
18 Correct 3 ms 2900 KB Output is correct
19 Correct 3 ms 2900 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 2 ms 2900 KB Output is correct
22 Correct 4 ms 2900 KB Output is correct
23 Correct 3 ms 2900 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 4 ms 2900 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2908 KB Output is correct
2 Correct 3 ms 2900 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 2900 KB Output is correct
6 Correct 4 ms 2900 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 5 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 3 ms 2900 KB Output is correct
12 Correct 3 ms 2900 KB Output is correct
13 Correct 3 ms 2900 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 4 ms 2900 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 3 ms 2900 KB Output is correct
18 Correct 3 ms 2900 KB Output is correct
19 Correct 3 ms 2900 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 2 ms 2900 KB Output is correct
22 Correct 4 ms 2900 KB Output is correct
23 Correct 3 ms 2900 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 4 ms 2900 KB Output is correct
26 Correct 249 ms 3244 KB Output is correct
27 Correct 38 ms 3156 KB Output is correct
28 Correct 247 ms 3260 KB Output is correct
29 Correct 38 ms 3156 KB Output is correct
30 Correct 250 ms 3156 KB Output is correct
31 Correct 33 ms 3156 KB Output is correct
32 Correct 213 ms 3240 KB Output is correct
33 Correct 36 ms 3240 KB Output is correct
34 Correct 24 ms 3156 KB Output is correct
35 Correct 38 ms 3156 KB Output is correct
36 Correct 223 ms 3236 KB Output is correct
37 Correct 33 ms 3156 KB Output is correct
38 Correct 216 ms 3252 KB Output is correct
39 Correct 34 ms 3156 KB Output is correct
40 Correct 252 ms 3240 KB Output is correct
41 Correct 35 ms 3156 KB Output is correct
42 Correct 246 ms 3260 KB Output is correct
43 Correct 45 ms 3156 KB Output is correct
44 Correct 219 ms 3244 KB Output is correct
45 Correct 33 ms 3156 KB Output is correct
46 Correct 245 ms 3244 KB Output is correct
47 Correct 3 ms 3156 KB Output is correct
48 Correct 126 ms 3156 KB Output is correct
49 Correct 123 ms 3204 KB Output is correct
50 Correct 240 ms 3256 KB Output is correct
51 Correct 249 ms 3248 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 800 ms 4564 KB Output is correct
2 Correct 10 ms 4564 KB Output is correct
3 Correct 673 ms 4564 KB Output is correct
4 Correct 9 ms 4564 KB Output is correct
5 Correct 661 ms 4564 KB Output is correct
6 Correct 8 ms 4436 KB Output is correct
7 Correct 696 ms 4564 KB Output is correct
8 Correct 9 ms 4436 KB Output is correct
9 Correct 690 ms 4568 KB Output is correct
10 Correct 9 ms 4436 KB Output is correct
11 Correct 816 ms 4576 KB Output is correct
12 Correct 9 ms 4436 KB Output is correct
13 Correct 690 ms 4560 KB Output is correct
14 Correct 654 ms 4512 KB Output is correct
15 Correct 9 ms 4496 KB Output is correct
16 Correct 746 ms 4568 KB Output is correct
17 Correct 11 ms 4564 KB Output is correct
18 Correct 758 ms 4556 KB Output is correct
19 Correct 13 ms 4436 KB Output is correct
20 Correct 799 ms 4560 KB Output is correct
21 Correct 8 ms 4456 KB Output is correct
22 Correct 377 ms 4564 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2908 KB Output is correct
2 Correct 3 ms 2900 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 2900 KB Output is correct
6 Correct 4 ms 2900 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 5 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 4 ms 2772 KB Output is correct
11 Correct 3 ms 2900 KB Output is correct
12 Correct 3 ms 2900 KB Output is correct
13 Correct 3 ms 2900 KB Output is correct
14 Correct 3 ms 2900 KB Output is correct
15 Correct 4 ms 2900 KB Output is correct
16 Correct 4 ms 2900 KB Output is correct
17 Correct 3 ms 2900 KB Output is correct
18 Correct 3 ms 2900 KB Output is correct
19 Correct 3 ms 2900 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 2 ms 2900 KB Output is correct
22 Correct 4 ms 2900 KB Output is correct
23 Correct 3 ms 2900 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 4 ms 2900 KB Output is correct
26 Correct 249 ms 3244 KB Output is correct
27 Correct 38 ms 3156 KB Output is correct
28 Correct 247 ms 3260 KB Output is correct
29 Correct 38 ms 3156 KB Output is correct
30 Correct 250 ms 3156 KB Output is correct
31 Correct 33 ms 3156 KB Output is correct
32 Correct 213 ms 3240 KB Output is correct
33 Correct 36 ms 3240 KB Output is correct
34 Correct 24 ms 3156 KB Output is correct
35 Correct 38 ms 3156 KB Output is correct
36 Correct 223 ms 3236 KB Output is correct
37 Correct 33 ms 3156 KB Output is correct
38 Correct 216 ms 3252 KB Output is correct
39 Correct 34 ms 3156 KB Output is correct
40 Correct 252 ms 3240 KB Output is correct
41 Correct 35 ms 3156 KB Output is correct
42 Correct 246 ms 3260 KB Output is correct
43 Correct 45 ms 3156 KB Output is correct
44 Correct 219 ms 3244 KB Output is correct
45 Correct 33 ms 3156 KB Output is correct
46 Correct 245 ms 3244 KB Output is correct
47 Correct 3 ms 3156 KB Output is correct
48 Correct 126 ms 3156 KB Output is correct
49 Correct 123 ms 3204 KB Output is correct
50 Correct 240 ms 3256 KB Output is correct
51 Correct 249 ms 3248 KB Output is correct
52 Correct 800 ms 4564 KB Output is correct
53 Correct 10 ms 4564 KB Output is correct
54 Correct 673 ms 4564 KB Output is correct
55 Correct 9 ms 4564 KB Output is correct
56 Correct 661 ms 4564 KB Output is correct
57 Correct 8 ms 4436 KB Output is correct
58 Correct 696 ms 4564 KB Output is correct
59 Correct 9 ms 4436 KB Output is correct
60 Correct 690 ms 4568 KB Output is correct
61 Correct 9 ms 4436 KB Output is correct
62 Correct 816 ms 4576 KB Output is correct
63 Correct 9 ms 4436 KB Output is correct
64 Correct 690 ms 4560 KB Output is correct
65 Correct 654 ms 4512 KB Output is correct
66 Correct 9 ms 4496 KB Output is correct
67 Correct 746 ms 4568 KB Output is correct
68 Correct 11 ms 4564 KB Output is correct
69 Correct 758 ms 4556 KB Output is correct
70 Correct 13 ms 4436 KB Output is correct
71 Correct 799 ms 4560 KB Output is correct
72 Correct 8 ms 4456 KB Output is correct
73 Correct 377 ms 4564 KB Output is correct
74 Execution timed out 3049 ms 8240 KB Time limit exceeded
75 Halted 0 ms 0 KB -