oj.uz

Submission #1000837

# Submission time Handle Problem Language Result Execution time Memory
1000837 2024-06-18T09:58:56 Z LOLOLO Tug of War (BOI15_tug) C++17
71 / 100
 512 ms 4464 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 3e4 + 100;
set <pair <int, int>> ed[N];
bool used[N];
int st = 0, s[N];

pair <int, int> dfs(int u, int v) {
    if (used[u])
        return {0, 0};

    used[u] = 1; 
    pair <int, int> A = {0, 0};
    for (auto x : ed[u]) {
        if (x.s == v)
            continue;
 
        A = dfs(x.f, x.s);
        A.f += s[x.s];
        swap(A.f, A.s);
    }
 
    return A;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int n, k;
    cin >> n >> k;
 
    int S = 0;
    for (int i = 1; i <= n * 2; i++) {
        int l, r;
        cin >> l >> r >> s[i];
        ed[l].insert({r + n, i});
        ed[r + n].insert({l, i});
        S += s[i];
    } 
 
    queue <int> pq;
    int sz = n * 2;
    for (int i = 1; i <= sz; i++) {
        if (sz(ed[i]) == 0) {
            cout << "NO\n";
            return 0;
        }
 
        if (sz(ed[i]) == 1)
            pq.push(i);
    }
 
    int L = 0;
    while (sz(pq)) {
        int t = pq.front();
        pq.pop();

        if (sz(ed[t]) == 0) {
            continue;
        }
 
        auto it = *ed[t].begin();
        int nxt = it.f, cost = it.s;
        pair <int, int> pat = {t, cost};
 
        ed[nxt].erase(pat);
        ed[t].clear();
        if (t <= n)
            L += s[cost];
 
        if (sz(ed[nxt]) == 1) {
            pq.push(nxt);
        }
    }
 
    for (int i = 1; i <= sz; i++) {
        if (sz(ed[i]) > 2) {
            cout << "NO\n";
            return 0;
        }
    }
 
    bitset <1000001> dp;
    dp[0] = 1;
 
    for (int i = 1; i <= sz; i++) {
        if (sz(ed[i]) == 2 && used[i] == 0) {
            auto it = *ed[i].begin();
            pair <int, int> A = dfs(i, it.s);
            dp = (dp << A.f) | (dp << A.s);
        }
    }
 
 
    for (int i = 0; i <= 600000; i++) {
        if (dp[i]) {
            if (abs((S - (L + i)) - (L + i)) <= k) {
                cout << "YES\n";
                return 0;
            }
        }
    }
 
    cout << "NO\n";
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2452 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 1 ms 2140 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 2 ms 2392 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 94 ms 2860 KB Output is correct
27 Correct 17 ms 2648 KB Output is correct
28 Correct 95 ms 2652 KB Output is correct
29 Correct 18 ms 2648 KB Output is correct
30 Correct 106 ms 2860 KB Output is correct
31 Correct 15 ms 2652 KB Output is correct
32 Correct 108 ms 2648 KB Output is correct
33 Correct 15 ms 2652 KB Output is correct
34 Correct 9 ms 2652 KB Output is correct
35 Correct 18 ms 2652 KB Output is correct
36 Correct 91 ms 2648 KB Output is correct
37 Correct 21 ms 2648 KB Output is correct
38 Correct 96 ms 2860 KB Output is correct
39 Correct 15 ms 2648 KB Output is correct
40 Correct 95 ms 2852 KB Output is correct
41 Correct 19 ms 2648 KB Output is correct
42 Correct 93 ms 2652 KB Output is correct
43 Correct 15 ms 2648 KB Output is correct
44 Correct 93 ms 2652 KB Output is correct
45 Correct 15 ms 2648 KB Output is correct
46 Correct 93 ms 2652 KB Output is correct
47 Correct 2 ms 2652 KB Output is correct
48 Correct 48 ms 2872 KB Output is correct
49 Correct 48 ms 2904 KB Output is correct
50 Correct 102 ms 2652 KB Output is correct
51 Correct 94 ms 2652 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 4440 KB Output is correct
2 Correct 7 ms 4188 KB Output is correct
3 Correct 503 ms 4432 KB Output is correct
4 Correct 7 ms 4188 KB Output is correct
5 Correct 468 ms 4428 KB Output is correct
6 Correct 9 ms 4188 KB Output is correct
7 Correct 482 ms 4432 KB Output is correct
8 Correct 9 ms 4184 KB Output is correct
9 Correct 512 ms 4444 KB Output is correct
10 Correct 6 ms 4184 KB Output is correct
11 Correct 473 ms 4236 KB Output is correct
12 Correct 7 ms 4188 KB Output is correct
13 Correct 475 ms 4428 KB Output is correct
14 Correct 475 ms 4444 KB Output is correct
15 Correct 7 ms 4188 KB Output is correct
16 Correct 491 ms 4444 KB Output is correct
17 Correct 9 ms 4188 KB Output is correct
18 Correct 482 ms 4444 KB Output is correct
19 Correct 7 ms 4188 KB Output is correct
20 Correct 468 ms 4444 KB Output is correct
21 Correct 8 ms 4184 KB Output is correct
22 Correct 239 ms 4464 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2452 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 1 ms 2140 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2392 KB Output is correct
24 Correct 2 ms 2392 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 94 ms 2860 KB Output is correct
27 Correct 17 ms 2648 KB Output is correct
28 Correct 95 ms 2652 KB Output is correct
29 Correct 18 ms 2648 KB Output is correct
30 Correct 106 ms 2860 KB Output is correct
31 Correct 15 ms 2652 KB Output is correct
32 Correct 108 ms 2648 KB Output is correct
33 Correct 15 ms 2652 KB Output is correct
34 Correct 9 ms 2652 KB Output is correct
35 Correct 18 ms 2652 KB Output is correct
36 Correct 91 ms 2648 KB Output is correct
37 Correct 21 ms 2648 KB Output is correct
38 Correct 96 ms 2860 KB Output is correct
39 Correct 15 ms 2648 KB Output is correct
40 Correct 95 ms 2852 KB Output is correct
41 Correct 19 ms 2648 KB Output is correct
42 Correct 93 ms 2652 KB Output is correct
43 Correct 15 ms 2648 KB Output is correct
44 Correct 93 ms 2652 KB Output is correct
45 Correct 15 ms 2648 KB Output is correct
46 Correct 93 ms 2652 KB Output is correct
47 Correct 2 ms 2652 KB Output is correct
48 Correct 48 ms 2872 KB Output is correct
49 Correct 48 ms 2904 KB Output is correct
50 Correct 102 ms 2652 KB Output is correct
51 Correct 94 ms 2652 KB Output is correct
52 Correct 481 ms 4440 KB Output is correct
53 Correct 7 ms 4188 KB Output is correct
54 Correct 503 ms 4432 KB Output is correct
55 Correct 7 ms 4188 KB Output is correct
56 Correct 468 ms 4428 KB Output is correct
57 Correct 9 ms 4188 KB Output is correct
58 Correct 482 ms 4432 KB Output is correct
59 Correct 9 ms 4184 KB Output is correct
60 Correct 512 ms 4444 KB Output is correct
61 Correct 6 ms 4184 KB Output is correct
62 Correct 473 ms 4236 KB Output is correct
63 Correct 7 ms 4188 KB Output is correct
64 Correct 475 ms 4428 KB Output is correct
65 Correct 475 ms 4444 KB Output is correct
66 Correct 7 ms 4188 KB Output is correct
67 Correct 491 ms 4444 KB Output is correct
68 Correct 9 ms 4188 KB Output is correct
69 Correct 482 ms 4444 KB Output is correct
70 Correct 7 ms 4188 KB Output is correct
71 Correct 468 ms 4444 KB Output is correct
72 Correct 8 ms 4184 KB Output is correct
73 Correct 239 ms 4464 KB Output is correct
74 Runtime error 4 ms 4444 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -