oj.uz

Submission #1000836

# Submission time Handle Problem Language Result Execution time Memory
1000836 2024-06-18T09:58:16 Z LOLOLO Tug of War (BOI15_tug) C++17
71 / 100
 280 ms 4248 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 <600001> 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 2136 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 2 ms 2140 KB Output is correct
4 Correct 1 ms 2140 KB Output is correct
5 Correct 1 ms 2140 KB Output is correct
6 Correct 1 ms 2140 KB Output is correct
7 Correct 1 ms 2140 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 1 ms 2140 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 1 ms 2124 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 1 ms 2140 KB Output is correct
18 Correct 1 ms 2140 KB Output is correct
19 Correct 1 ms 2140 KB Output is correct
20 Correct 2 ms 2140 KB Output is correct
21 Correct 1 ms 2136 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 2 ms 2140 KB Output is correct
24 Correct 1 ms 2136 KB Output is correct
25 Correct 2 ms 2140 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2136 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 2 ms 2140 KB Output is correct
4 Correct 1 ms 2140 KB Output is correct
5 Correct 1 ms 2140 KB Output is correct
6 Correct 1 ms 2140 KB Output is correct
7 Correct 1 ms 2140 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 1 ms 2140 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 1 ms 2124 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 1 ms 2140 KB Output is correct
18 Correct 1 ms 2140 KB Output is correct
19 Correct 1 ms 2140 KB Output is correct
20 Correct 2 ms 2140 KB Output is correct
21 Correct 1 ms 2136 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 2 ms 2140 KB Output is correct
24 Correct 1 ms 2136 KB Output is correct
25 Correct 2 ms 2140 KB Output is correct
26 Correct 53 ms 2396 KB Output is correct
27 Correct 10 ms 2392 KB Output is correct
28 Correct 55 ms 2396 KB Output is correct
29 Correct 10 ms 2396 KB Output is correct
30 Correct 53 ms 2612 KB Output is correct
31 Correct 14 ms 2640 KB Output is correct
32 Correct 54 ms 2620 KB Output is correct
33 Correct 10 ms 2648 KB Output is correct
34 Correct 6 ms 2396 KB Output is correct
35 Correct 10 ms 2636 KB Output is correct
36 Correct 54 ms 2396 KB Output is correct
37 Correct 13 ms 2392 KB Output is correct
38 Correct 54 ms 2396 KB Output is correct
39 Correct 13 ms 2396 KB Output is correct
40 Correct 57 ms 2396 KB Output is correct
41 Correct 10 ms 2396 KB Output is correct
42 Correct 54 ms 2396 KB Output is correct
43 Correct 10 ms 2396 KB Output is correct
44 Correct 53 ms 2396 KB Output is correct
45 Correct 11 ms 2392 KB Output is correct
46 Correct 55 ms 2396 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 40 ms 2396 KB Output is correct
49 Correct 29 ms 2652 KB Output is correct
50 Correct 72 ms 2652 KB Output is correct
51 Correct 54 ms 2652 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 4184 KB Output is correct
2 Correct 6 ms 3928 KB Output is correct
3 Correct 280 ms 4184 KB Output is correct
4 Correct 7 ms 3928 KB Output is correct
5 Correct 273 ms 4188 KB Output is correct
6 Correct 6 ms 3928 KB Output is correct
7 Correct 269 ms 4192 KB Output is correct
8 Correct 8 ms 3928 KB Output is correct
9 Correct 269 ms 4196 KB Output is correct
10 Correct 8 ms 3932 KB Output is correct
11 Correct 271 ms 4188 KB Output is correct
12 Correct 7 ms 3932 KB Output is correct
13 Correct 266 ms 4188 KB Output is correct
14 Correct 276 ms 4180 KB Output is correct
15 Correct 8 ms 3932 KB Output is correct
16 Correct 264 ms 4188 KB Output is correct
17 Correct 8 ms 3928 KB Output is correct
18 Correct 276 ms 4196 KB Output is correct
19 Correct 6 ms 3932 KB Output is correct
20 Correct 269 ms 4192 KB Output is correct
21 Correct 7 ms 3932 KB Output is correct
22 Correct 147 ms 4248 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2136 KB Output is correct
2 Correct 1 ms 2140 KB Output is correct
3 Correct 2 ms 2140 KB Output is correct
4 Correct 1 ms 2140 KB Output is correct
5 Correct 1 ms 2140 KB Output is correct
6 Correct 1 ms 2140 KB Output is correct
7 Correct 1 ms 2140 KB Output is correct
8 Correct 1 ms 2140 KB Output is correct
9 Correct 1 ms 2140 KB Output is correct
10 Correct 1 ms 2140 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 1 ms 2140 KB Output is correct
14 Correct 1 ms 2124 KB Output is correct
15 Correct 1 ms 2140 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 1 ms 2140 KB Output is correct
18 Correct 1 ms 2140 KB Output is correct
19 Correct 1 ms 2140 KB Output is correct
20 Correct 2 ms 2140 KB Output is correct
21 Correct 1 ms 2136 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 2 ms 2140 KB Output is correct
24 Correct 1 ms 2136 KB Output is correct
25 Correct 2 ms 2140 KB Output is correct
26 Correct 53 ms 2396 KB Output is correct
27 Correct 10 ms 2392 KB Output is correct
28 Correct 55 ms 2396 KB Output is correct
29 Correct 10 ms 2396 KB Output is correct
30 Correct 53 ms 2612 KB Output is correct
31 Correct 14 ms 2640 KB Output is correct
32 Correct 54 ms 2620 KB Output is correct
33 Correct 10 ms 2648 KB Output is correct
34 Correct 6 ms 2396 KB Output is correct
35 Correct 10 ms 2636 KB Output is correct
36 Correct 54 ms 2396 KB Output is correct
37 Correct 13 ms 2392 KB Output is correct
38 Correct 54 ms 2396 KB Output is correct
39 Correct 13 ms 2396 KB Output is correct
40 Correct 57 ms 2396 KB Output is correct
41 Correct 10 ms 2396 KB Output is correct
42 Correct 54 ms 2396 KB Output is correct
43 Correct 10 ms 2396 KB Output is correct
44 Correct 53 ms 2396 KB Output is correct
45 Correct 11 ms 2392 KB Output is correct
46 Correct 55 ms 2396 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 40 ms 2396 KB Output is correct
49 Correct 29 ms 2652 KB Output is correct
50 Correct 72 ms 2652 KB Output is correct
51 Correct 54 ms 2652 KB Output is correct
52 Correct 273 ms 4184 KB Output is correct
53 Correct 6 ms 3928 KB Output is correct
54 Correct 280 ms 4184 KB Output is correct
55 Correct 7 ms 3928 KB Output is correct
56 Correct 273 ms 4188 KB Output is correct
57 Correct 6 ms 3928 KB Output is correct
58 Correct 269 ms 4192 KB Output is correct
59 Correct 8 ms 3928 KB Output is correct
60 Correct 269 ms 4196 KB Output is correct
61 Correct 8 ms 3932 KB Output is correct
62 Correct 271 ms 4188 KB Output is correct
63 Correct 7 ms 3932 KB Output is correct
64 Correct 266 ms 4188 KB Output is correct
65 Correct 276 ms 4180 KB Output is correct
66 Correct 8 ms 3932 KB Output is correct
67 Correct 264 ms 4188 KB Output is correct
68 Correct 8 ms 3928 KB Output is correct
69 Correct 276 ms 4196 KB Output is correct
70 Correct 6 ms 3932 KB Output is correct
71 Correct 269 ms 4192 KB Output is correct
72 Correct 7 ms 3932 KB Output is correct
73 Correct 147 ms 4248 KB Output is correct
74 Runtime error 3 ms 3928 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -