oj.uz

Submission #162339

# Submission time Handle Problem Language Result Execution time Memory
162339 2019-11-07T15:31:03 Z farmerboy Tug of War (BOI15_tug) C++14
100 / 100
 2282 ms 10616 KB 
/*
    Author: Nguyen Tan Bao
    Status:
    Idea:
*/
 
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
//__builtin_ffs(x) return 1 + index of least significant 1-bit of x
//__builtin_clz(x) return number of leading zeros of x
//__builtin_ctz(x) return number of trailing zeros of x
 
using namespace std;
using ll = long long;
using ld = double;
typedef pair<int, int> II;
typedef pair<int, II> III;
typedef complex<ld> cd;
typedef vector<cd> vcd;
 
const ll MODBASE = 1000000007LL;
const int MAXN = 60010;
const int MAXM = 600010;
const int MAXK = 110;
const int MAXQ = 200010;

int n, k, deg[MAXN], diff;
multiset<II> a[MAXN];
queue<int> q;
bool visited[MAXN];
vector<int> dp;
bitset<MAXM> kns;

void dfs(int u) {
    visited[u] = true;
    if (SZ(a[u]) == 0) return;
    int v = a[u].begin()->FI;
    int c = a[u].begin()->SE;
    a[u].erase(a[u].begin());
    a[v].erase(a[v].find(II(u, c)));
    if (u < n) diff += c;
    else diff -= c;
    dfs(v);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cin >> n >> k;
    FOR(i,1,2*n) {
        int u, v, c;
        cin >> u >> v >> c;
        u--;
        v--; v += n;
        a[u].insert(II(v, c));
        a[v].insert(II(u, c));
        deg[u]++;
        deg[v]++;
    }
    FOR(i,0,2*n-1)
        if (deg[i] == 1) q.push(i);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        visited[u] = true;
        if (SZ(a[u]) == 0) continue;
        int v = a[u].begin()->FI;
        int c = a[u].begin()->SE;
        a[u].erase(a[u].begin());
        deg[u]--;
        deg[v]--;
        a[v].erase(a[v].find(II(u, c)));
        if (deg[v] == 1) q.push(v);
        if (u < n) diff += c;
        else diff -= c;
    }
    if (diff) {
        dp.push_back(abs(diff));
        diff = 0;
    }
    FOR(i,0,2*n-1) {
        if (!visited[i]) {
            if (deg[i] != 2) {
                cout << "NO";
                return 0;
            }
            dfs(i);
            if (diff) {
                dp.push_back(abs(diff));
                diff = 0;
            }
        }
    }
    sort(dp.rbegin(), dp.rend());
    if (SZ(dp) == 0) {
        cout << "YES\n";
        return 0;
    }

    kns[MAXM/2] = 1;
    FOR(i,0,SZ(dp)-1) kns = (kns<<dp[i]) | (kns>>dp[i]);

    bool res = false;
    FOR(i,MAXM/2,MAXM/2+k) res |= kns[i];
    if (res) cout << "YES";
    else cout << "NO";
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3448 KB Output is correct
2 Correct 6 ms 3448 KB Output is correct
3 Correct 5 ms 3576 KB Output is correct
4 Correct 5 ms 3576 KB Output is correct
5 Correct 6 ms 3576 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 6 ms 3576 KB Output is correct
10 Correct 6 ms 3576 KB Output is correct
11 Correct 5 ms 3548 KB Output is correct
12 Correct 5 ms 3576 KB Output is correct
13 Correct 6 ms 3576 KB Output is correct
14 Correct 5 ms 3576 KB Output is correct
15 Correct 6 ms 3576 KB Output is correct
16 Correct 5 ms 3452 KB Output is correct
17 Correct 5 ms 3576 KB Output is correct
18 Correct 5 ms 3576 KB Output is correct
19 Correct 6 ms 3448 KB Output is correct
20 Correct 6 ms 3448 KB Output is correct
21 Correct 5 ms 3192 KB Output is correct
22 Correct 6 ms 3588 KB Output is correct
23 Correct 5 ms 3448 KB Output is correct
24 Correct 5 ms 3576 KB Output is correct
25 Correct 5 ms 3448 KB Output is correct
26 Correct 146 ms 3984 KB Output is correct
27 Correct 27 ms 3960 KB Output is correct
28 Correct 145 ms 4060 KB Output is correct
29 Correct 27 ms 3960 KB Output is correct
30 Correct 142 ms 3964 KB Output is correct
31 Correct 27 ms 3960 KB Output is correct
32 Correct 143 ms 3960 KB Output is correct
33 Correct 27 ms 4004 KB Output is correct
34 Correct 18 ms 3960 KB Output is correct
35 Correct 27 ms 3960 KB Output is correct
36 Correct 144 ms 4088 KB Output is correct
37 Correct 27 ms 3960 KB Output is correct
38 Correct 148 ms 4060 KB Output is correct
39 Correct 27 ms 3960 KB Output is correct
40 Correct 147 ms 3960 KB Output is correct
41 Correct 31 ms 3960 KB Output is correct
42 Correct 147 ms 3960 KB Output is correct
43 Correct 27 ms 3960 KB Output is correct
44 Correct 145 ms 4164 KB Output is correct
45 Correct 27 ms 3960 KB Output is correct
46 Correct 174 ms 3992 KB Output is correct
47 Correct 7 ms 3576 KB Output is correct
48 Correct 77 ms 3960 KB Output is correct
49 Correct 78 ms 3960 KB Output is correct
50 Correct 153 ms 4060 KB Output is correct
51 Correct 157 ms 3960 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5112 KB Output is correct
2 Correct 20 ms 5240 KB Output is correct
3 Correct 16 ms 5112 KB Output is correct
4 Correct 20 ms 5244 KB Output is correct
5 Correct 17 ms 5112 KB Output is correct
6 Correct 20 ms 5240 KB Output is correct
7 Correct 17 ms 5112 KB Output is correct
8 Correct 20 ms 5240 KB Output is correct
9 Correct 17 ms 5112 KB Output is correct
10 Correct 20 ms 5112 KB Output is correct
11 Correct 16 ms 5112 KB Output is correct
12 Correct 18 ms 5112 KB Output is correct
13 Correct 16 ms 5112 KB Output is correct
14 Correct 18 ms 5112 KB Output is correct
15 Correct 19 ms 5240 KB Output is correct
16 Correct 18 ms 5112 KB Output is correct
17 Correct 20 ms 5240 KB Output is correct
18 Correct 17 ms 5112 KB Output is correct
19 Correct 18 ms 5240 KB Output is correct
20 Correct 17 ms 5112 KB Output is correct
21 Correct 19 ms 5216 KB Output is correct
22 Correct 20 ms 5112 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3448 KB Output is correct
2 Correct 6 ms 3448 KB Output is correct
3 Correct 5 ms 3576 KB Output is correct
4 Correct 5 ms 3576 KB Output is correct
5 Correct 6 ms 3576 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 6 ms 3576 KB Output is correct
10 Correct 6 ms 3576 KB Output is correct
11 Correct 5 ms 3548 KB Output is correct
12 Correct 5 ms 3576 KB Output is correct
13 Correct 6 ms 3576 KB Output is correct
14 Correct 5 ms 3576 KB Output is correct
15 Correct 6 ms 3576 KB Output is correct
16 Correct 5 ms 3452 KB Output is correct
17 Correct 5 ms 3576 KB Output is correct
18 Correct 5 ms 3576 KB Output is correct
19 Correct 6 ms 3448 KB Output is correct
20 Correct 6 ms 3448 KB Output is correct
21 Correct 5 ms 3192 KB Output is correct
22 Correct 6 ms 3588 KB Output is correct
23 Correct 5 ms 3448 KB Output is correct
24 Correct 5 ms 3576 KB Output is correct
25 Correct 5 ms 3448 KB Output is correct
26 Correct 146 ms 3984 KB Output is correct
27 Correct 27 ms 3960 KB Output is correct
28 Correct 145 ms 4060 KB Output is correct
29 Correct 27 ms 3960 KB Output is correct
30 Correct 142 ms 3964 KB Output is correct
31 Correct 27 ms 3960 KB Output is correct
32 Correct 143 ms 3960 KB Output is correct
33 Correct 27 ms 4004 KB Output is correct
34 Correct 18 ms 3960 KB Output is correct
35 Correct 27 ms 3960 KB Output is correct
36 Correct 144 ms 4088 KB Output is correct
37 Correct 27 ms 3960 KB Output is correct
38 Correct 148 ms 4060 KB Output is correct
39 Correct 27 ms 3960 KB Output is correct
40 Correct 147 ms 3960 KB Output is correct
41 Correct 31 ms 3960 KB Output is correct
42 Correct 147 ms 3960 KB Output is correct
43 Correct 27 ms 3960 KB Output is correct
44 Correct 145 ms 4164 KB Output is correct
45 Correct 27 ms 3960 KB Output is correct
46 Correct 174 ms 3992 KB Output is correct
47 Correct 7 ms 3576 KB Output is correct
48 Correct 77 ms 3960 KB Output is correct
49 Correct 78 ms 3960 KB Output is correct
50 Correct 153 ms 4060 KB Output is correct
51 Correct 157 ms 3960 KB Output is correct
52 Correct 16 ms 5112 KB Output is correct
53 Correct 20 ms 5240 KB Output is correct
54 Correct 16 ms 5112 KB Output is correct
55 Correct 20 ms 5244 KB Output is correct
56 Correct 17 ms 5112 KB Output is correct
57 Correct 20 ms 5240 KB Output is correct
58 Correct 17 ms 5112 KB Output is correct
59 Correct 20 ms 5240 KB Output is correct
60 Correct 17 ms 5112 KB Output is correct
61 Correct 20 ms 5112 KB Output is correct
62 Correct 16 ms 5112 KB Output is correct
63 Correct 18 ms 5112 KB Output is correct
64 Correct 16 ms 5112 KB Output is correct
65 Correct 18 ms 5112 KB Output is correct
66 Correct 19 ms 5240 KB Output is correct
67 Correct 18 ms 5112 KB Output is correct
68 Correct 20 ms 5240 KB Output is correct
69 Correct 17 ms 5112 KB Output is correct
70 Correct 18 ms 5240 KB Output is correct
71 Correct 17 ms 5112 KB Output is correct
72 Correct 19 ms 5216 KB Output is correct
73 Correct 20 ms 5112 KB Output is correct
74 Correct 2203 ms 9632 KB Output is correct
75 Correct 152 ms 10232 KB Output is correct
76 Correct 2136 ms 10492 KB Output is correct
77 Correct 152 ms 10232 KB Output is correct
78 Correct 2140 ms 10524 KB Output is correct
79 Correct 2142 ms 10616 KB Output is correct
80 Correct 152 ms 10340 KB Output is correct
81 Correct 164 ms 10284 KB Output is correct
82 Correct 2272 ms 10304 KB Output is correct
83 Correct 2169 ms 10488 KB Output is correct
84 Correct 144 ms 10232 KB Output is correct
85 Correct 2275 ms 10492 KB Output is correct
86 Correct 171 ms 10304 KB Output is correct
87 Correct 2152 ms 10544 KB Output is correct
88 Correct 159 ms 10316 KB Output is correct
89 Correct 2123 ms 10464 KB Output is correct
90 Correct 170 ms 10320 KB Output is correct
91 Correct 2150 ms 10496 KB Output is correct
92 Correct 151 ms 10360 KB Output is correct
93 Correct 2240 ms 10476 KB Output is correct
94 Correct 66 ms 9976 KB Output is correct
95 Correct 1132 ms 10488 KB Output is correct
96 Correct 1118 ms 10488 KB Output is correct
97 Correct 2255 ms 10616 KB Output is correct
98 Correct 2282 ms 10488 KB Output is correct