oj.uz

Submission #559390

# Submission time Handle Problem Language Result Execution time Memory
559390 2022-05-09T17:23:08 Z Olympia Tug of War (BOI15_tug) C++17
41 / 100
 535 ms 5588 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);
        }
    }
}
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;
            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 = 0; 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:76:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         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 1 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 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 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 2 ms 596 KB Output is correct
20 Correct 2 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 2 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct

Subtask #2
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 1 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 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 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 2 ms 596 KB Output is correct
20 Correct 2 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 2 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 109 ms 1484 KB Output is correct
27 Correct 14 ms 1492 KB Output is correct
28 Correct 106 ms 1364 KB Output is correct
29 Correct 12 ms 1620 KB Output is correct
30 Correct 105 ms 1424 KB Output is correct
31 Correct 14 ms 1620 KB Output is correct
32 Correct 127 ms 1420 KB Output is correct
33 Correct 19 ms 1556 KB Output is correct
34 Correct 8 ms 1492 KB Output is correct
35 Correct 13 ms 1492 KB Output is correct
36 Correct 106 ms 1364 KB Output is correct
37 Correct 14 ms 1620 KB Output is correct
38 Correct 107 ms 1436 KB Output is correct
39 Correct 14 ms 1620 KB Output is correct
40 Correct 115 ms 1364 KB Output is correct
41 Correct 18 ms 1620 KB Output is correct
42 Correct 111 ms 1364 KB Output is correct
43 Correct 13 ms 1620 KB Output is correct
44 Correct 107 ms 1364 KB Output is correct
45 Correct 14 ms 1620 KB Output is correct
46 Correct 109 ms 1416 KB Output is correct
47 Correct 3 ms 1492 KB Output is correct
48 Incorrect 56 ms 1484 KB Output isn't correct
49 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 4724 KB Output is correct
2 Correct 19 ms 5584 KB Output is correct
3 Correct 414 ms 4736 KB Output is correct
4 Correct 14 ms 5588 KB Output is correct
5 Correct 423 ms 4640 KB Output is correct
6 Correct 14 ms 5588 KB Output is correct
7 Correct 417 ms 4848 KB Output is correct
8 Correct 20 ms 5540 KB Output is correct
9 Correct 413 ms 4684 KB Output is correct
10 Correct 14 ms 5500 KB Output is correct
11 Correct 535 ms 4728 KB Output is correct
12 Correct 16 ms 5588 KB Output is correct
13 Correct 459 ms 4684 KB Output is correct
14 Correct 407 ms 4812 KB Output is correct
15 Correct 20 ms 5588 KB Output is correct
16 Correct 411 ms 4736 KB Output is correct
17 Correct 14 ms 5588 KB Output is correct
18 Correct 437 ms 4752 KB Output is correct
19 Correct 16 ms 5588 KB Output is correct
20 Correct 410 ms 4740 KB Output is correct
21 Correct 14 ms 5332 KB Output is correct
22 Correct 218 ms 5108 KB Output is correct

Subtask #4
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 1 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 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 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 2 ms 596 KB Output is correct
20 Correct 2 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 2 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 109 ms 1484 KB Output is correct
27 Correct 14 ms 1492 KB Output is correct
28 Correct 106 ms 1364 KB Output is correct
29 Correct 12 ms 1620 KB Output is correct
30 Correct 105 ms 1424 KB Output is correct
31 Correct 14 ms 1620 KB Output is correct
32 Correct 127 ms 1420 KB Output is correct
33 Correct 19 ms 1556 KB Output is correct
34 Correct 8 ms 1492 KB Output is correct
35 Correct 13 ms 1492 KB Output is correct
36 Correct 106 ms 1364 KB Output is correct
37 Correct 14 ms 1620 KB Output is correct
38 Correct 107 ms 1436 KB Output is correct
39 Correct 14 ms 1620 KB Output is correct
40 Correct 115 ms 1364 KB Output is correct
41 Correct 18 ms 1620 KB Output is correct
42 Correct 111 ms 1364 KB Output is correct
43 Correct 13 ms 1620 KB Output is correct
44 Correct 107 ms 1364 KB Output is correct
45 Correct 14 ms 1620 KB Output is correct
46 Correct 109 ms 1416 KB Output is correct
47 Correct 3 ms 1492 KB Output is correct
48 Incorrect 56 ms 1484 KB Output isn't correct
49 Halted 0 ms 0 KB -