oj.uz

Submission #559395

# Submission time Handle Problem Language Result Execution time Memory
559395 2022-05-09T17:32:31 Z Olympia Tug of War (BOI15_tug) C++17
100 / 100
 1691 ms 16468 KB 
#include <bits/stdc++.h>
using namespace std;
vector<multiset<pair<int,int> > > adj;
vector<bool> hasVisited;
int ans = 0;
void dfs (int curNode, int prevNode) {
    if (hasVisited[curNode]) {
        return;
    }
    hasVisited[curNode] = true;
    for (pair<int,int> p: adj[curNode]) {
        if (p.first != prevNode) {
            ans += p.second;
            dfs (p.first, curNode);
        }
    }
}
int c = 0;
void apply () {
    queue<int> q;
    for (int i = 0; i < adj.size(); i++) {
        if (adj[i].size() == 1) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        pair<int,int> p = *adj[x].begin();
        c += p.second;
        adj[x].clear();
        assert(adj[p.first].count(make_pair(x, -p.second)));
        adj[p.first].erase(adj[p.first].find(make_pair(x, -p.second)));
        if (adj[p.first].size() == 1) {
            q.push(p.first);
        }
        if (adj[p.first].empty()) {
            cout << "NO\n";
            exit(0);
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin >> n >> k;
    adj.resize(2 * n);
    hasVisited.assign(2 * n, false);
    map<pair<int,int>,vector<int> > myMap;
    for (int i = 0; i < 2 * n; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        u--, v--;
        v += n;
        myMap[make_pair(u, v)].push_back(w);
        adj[u].insert(make_pair(v, w));
        adj[v].insert(make_pair(u, -w));
    }
    for (int i = 0; i < 2 * n; i++) {
        if (adj[i].empty()) {
            cout << "NO\n";
            exit(0);
        }
    }
    apply();
    vector<int> tot;
    for (int i = 0; i < n; i++) {
        if (!hasVisited[i] && !adj[i].empty()) {
            ans = 0;
            assert(adj[i].size() == 2);
            dfs (i, (*adj[i].rbegin()).first);
            tot.push_back(abs(ans));
        }
    }
    for (auto& p: myMap) {
        if (p.second.size() <= 1) {
            continue;
        }
        int a = 0;
        for (int j = 0; j < p.second.size(); j++) {
            if (j % 2) a += p.second[j];
            else a -= p.second[j];
        }
        tot.push_back(abs(a));
    }
    bitset<600000> bs;
    bs.set(c + 300000);
    for (int j: tot) {
        bs = (bs >> j) | (bs << j);
    }
    for (int i = -k; i <= k; i++) {
        if (bs[300000 + i]) {
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
}

Compilation message

tug.cpp: In function 'void apply()':
tug.cpp:21:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::multiset<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for (int i = 0; i < adj.size(); i++) {
      |                     ~~^~~~~~~~~~~~
tug.cpp: In function 'int main()':
tug.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int j = 0; j < p.second.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 109 ms 1364 KB Output is correct
27 Correct 14 ms 1620 KB Output is correct
28 Correct 114 ms 1364 KB Output is correct
29 Correct 15 ms 1620 KB Output is correct
30 Correct 114 ms 1364 KB Output is correct
31 Correct 14 ms 1620 KB Output is correct
32 Correct 105 ms 1364 KB Output is correct
33 Correct 13 ms 1620 KB Output is correct
34 Correct 9 ms 1492 KB Output is correct
35 Correct 14 ms 1620 KB Output is correct
36 Correct 112 ms 1416 KB Output is correct
37 Correct 14 ms 1620 KB Output is correct
38 Correct 108 ms 1420 KB Output is correct
39 Correct 14 ms 1620 KB Output is correct
40 Correct 108 ms 1420 KB Output is correct
41 Correct 14 ms 1620 KB Output is correct
42 Correct 115 ms 1364 KB Output is correct
43 Correct 14 ms 1620 KB Output is correct
44 Correct 113 ms 1364 KB Output is correct
45 Correct 12 ms 1492 KB Output is correct
46 Correct 103 ms 1364 KB Output is correct
47 Correct 3 ms 1544 KB Output is correct
48 Correct 64 ms 1492 KB Output is correct
49 Correct 54 ms 1492 KB Output is correct
50 Correct 110 ms 1364 KB Output is correct
51 Correct 110 ms 1468 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 4736 KB Output is correct
2 Correct 20 ms 5588 KB Output is correct
3 Correct 374 ms 4728 KB Output is correct
4 Correct 22 ms 5624 KB Output is correct
5 Correct 421 ms 4692 KB Output is correct
6 Correct 15 ms 5588 KB Output is correct
7 Correct 391 ms 4728 KB Output is correct
8 Correct 19 ms 5588 KB Output is correct
9 Correct 359 ms 4736 KB Output is correct
10 Correct 17 ms 5556 KB Output is correct
11 Correct 390 ms 4692 KB Output is correct
12 Correct 19 ms 5528 KB Output is correct
13 Correct 354 ms 4728 KB Output is correct
14 Correct 412 ms 4812 KB Output is correct
15 Correct 14 ms 5588 KB Output is correct
16 Correct 376 ms 4736 KB Output is correct
17 Correct 20 ms 5584 KB Output is correct
18 Correct 370 ms 4748 KB Output is correct
19 Correct 15 ms 5616 KB Output is correct
20 Correct 365 ms 4736 KB Output is correct
21 Correct 23 ms 5332 KB Output is correct
22 Correct 207 ms 5140 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 109 ms 1364 KB Output is correct
27 Correct 14 ms 1620 KB Output is correct
28 Correct 114 ms 1364 KB Output is correct
29 Correct 15 ms 1620 KB Output is correct
30 Correct 114 ms 1364 KB Output is correct
31 Correct 14 ms 1620 KB Output is correct
32 Correct 105 ms 1364 KB Output is correct
33 Correct 13 ms 1620 KB Output is correct
34 Correct 9 ms 1492 KB Output is correct
35 Correct 14 ms 1620 KB Output is correct
36 Correct 112 ms 1416 KB Output is correct
37 Correct 14 ms 1620 KB Output is correct
38 Correct 108 ms 1420 KB Output is correct
39 Correct 14 ms 1620 KB Output is correct
40 Correct 108 ms 1420 KB Output is correct
41 Correct 14 ms 1620 KB Output is correct
42 Correct 115 ms 1364 KB Output is correct
43 Correct 14 ms 1620 KB Output is correct
44 Correct 113 ms 1364 KB Output is correct
45 Correct 12 ms 1492 KB Output is correct
46 Correct 103 ms 1364 KB Output is correct
47 Correct 3 ms 1544 KB Output is correct
48 Correct 64 ms 1492 KB Output is correct
49 Correct 54 ms 1492 KB Output is correct
50 Correct 110 ms 1364 KB Output is correct
51 Correct 110 ms 1468 KB Output is correct
52 Correct 387 ms 4736 KB Output is correct
53 Correct 20 ms 5588 KB Output is correct
54 Correct 374 ms 4728 KB Output is correct
55 Correct 22 ms 5624 KB Output is correct
56 Correct 421 ms 4692 KB Output is correct
57 Correct 15 ms 5588 KB Output is correct
58 Correct 391 ms 4728 KB Output is correct
59 Correct 19 ms 5588 KB Output is correct
60 Correct 359 ms 4736 KB Output is correct
61 Correct 17 ms 5556 KB Output is correct
62 Correct 390 ms 4692 KB Output is correct
63 Correct 19 ms 5528 KB Output is correct
64 Correct 354 ms 4728 KB Output is correct
65 Correct 412 ms 4812 KB Output is correct
66 Correct 14 ms 5588 KB Output is correct
67 Correct 376 ms 4736 KB Output is correct
68 Correct 20 ms 5584 KB Output is correct
69 Correct 370 ms 4748 KB Output is correct
70 Correct 15 ms 5616 KB Output is correct
71 Correct 365 ms 4736 KB Output is correct
72 Correct 23 ms 5332 KB Output is correct
73 Correct 207 ms 5140 KB Output is correct
74 Correct 1691 ms 13516 KB Output is correct
75 Correct 132 ms 16360 KB Output is correct
76 Correct 1635 ms 13464 KB Output is correct
77 Correct 165 ms 16468 KB Output is correct
78 Correct 1639 ms 13496 KB Output is correct
79 Correct 1578 ms 13516 KB Output is correct
80 Correct 137 ms 16412 KB Output is correct
81 Correct 151 ms 16352 KB Output is correct
82 Correct 1637 ms 13500 KB Output is correct
83 Correct 1619 ms 13500 KB Output is correct
84 Correct 150 ms 16416 KB Output is correct
85 Correct 1643 ms 13512 KB Output is correct
86 Correct 136 ms 16388 KB Output is correct
87 Correct 1620 ms 13496 KB Output is correct
88 Correct 139 ms 16452 KB Output is correct
89 Correct 1684 ms 13536 KB Output is correct
90 Correct 138 ms 16432 KB Output is correct
91 Correct 1636 ms 13440 KB Output is correct
92 Correct 136 ms 16356 KB Output is correct
93 Correct 1644 ms 13480 KB Output is correct
94 Correct 72 ms 15584 KB Output is correct
95 Correct 916 ms 15072 KB Output is correct
96 Correct 841 ms 14980 KB Output is correct
97 Correct 1604 ms 13456 KB Output is correct
98 Correct 1640 ms 13524 KB Output is correct