oj.uz

Submission #418073

# Submission time Handle Problem Language Result Execution time Memory
418073 2021-06-05T03:49:24 Z JerryLiu06 Tug of War (BOI15_tug) C++17
71 / 100
 188 ms 4556 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define EACH(a,x) for (auto& a: x)
 
const int MOD = 1e9 + 7;
const int MX = 3e4 + 10;
const ll INF = 1e18;

int N, K; multiset<pi> adj[MX]; int inDeg[MX], tot; bool vis[MX]; vi todo;

void DFS(int X) {
    vis[X] = true; pi E = *adj[X].bg();

    tot += E.s; if (!vis[E.f]) { adj[X].clear(); adj[E.f].erase(adj[E.f].find({X, -E.s})); DFS(E.f); }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N >> K; F0R(i, 2 * N) { 
        int A, B, S; cin >> A >> B >> S; 
        
        adj[A].insert({N + B, S}), adj[N + B].insert({A, -S});
    }
    queue<int> Q; FOR(i, 1, 2 * N + 1) { 
        if (sz(adj[i]) == 0) { cout << "NO"; return 0; } 

        if (sz(adj[i]) == 1) Q.push(i);
    }
    while (!Q.empty()) {
        int cur = Q.front(); Q.pop(); if (sz(adj[cur]) == 0) { cout << "NO"; return 0; }

        pi E = *adj[cur].bg(); tot += E.s; adj[cur].clear(); adj[E.f].erase(adj[E.f].find({cur, -E.s}));

        if (sz(adj[E.f]) == 1) Q.push(E.f);
    }
    if (tot) todo.pb(abs(tot)); FOR(i, 1, 2 * N + 1) if (!vis[i] && sz(adj[i])) {
        tot = 0; adj[i].erase(adj[i].bg()); DFS(i); if (tot) todo.pb(abs(tot));
    }
    bitset<40 * MX> DP; DP[20 * MX] = 1;EACH(C, todo) DP = (DP << C) | (DP >> C); 

    FOR(i, 20 * MX - K, 20 * MX + K + 1) if (DP[i]) { cout << "YES"; return 0; } cout << "NO";
}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:39:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   39 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
      |                    ^~~
tug.cpp:82:5: note: in expansion of macro 'FOR'
   82 |     FOR(i, 20 * MX - K, 20 * MX + K + 1) if (DP[i]) { cout << "YES"; return 0; } cout << "NO";
      |     ^~~
tug.cpp:82:82: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   82 |     FOR(i, 20 * MX - K, 20 * MX + K + 1) if (DP[i]) { cout << "YES"; return 0; } cout << "NO";
      |                                                                                  ^~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2252 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 2 ms 2252 KB Output is correct
5 Correct 2 ms 2252 KB Output is correct
6 Correct 2 ms 2252 KB Output is correct
7 Correct 3 ms 2252 KB Output is correct
8 Correct 2 ms 2312 KB Output is correct
9 Correct 2 ms 2252 KB Output is correct
10 Correct 2 ms 2252 KB Output is correct
11 Correct 3 ms 2252 KB Output is correct
12 Correct 3 ms 2252 KB Output is correct
13 Correct 3 ms 2380 KB Output is correct
14 Correct 2 ms 2252 KB Output is correct
15 Correct 2 ms 2252 KB Output is correct
16 Correct 2 ms 2252 KB Output is correct
17 Correct 3 ms 2252 KB Output is correct
18 Correct 2 ms 2312 KB Output is correct
19 Correct 3 ms 2252 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2312 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2252 KB Output is correct
25 Correct 2 ms 2252 KB Output is correct
26 Correct 175 ms 2636 KB Output is correct
27 Correct 28 ms 2740 KB Output is correct
28 Correct 178 ms 2636 KB Output is correct
29 Correct 28 ms 2636 KB Output is correct
30 Correct 176 ms 2740 KB Output is correct
31 Correct 28 ms 2636 KB Output is correct
32 Correct 176 ms 2684 KB Output is correct
33 Correct 31 ms 2636 KB Output is correct
34 Correct 17 ms 2836 KB Output is correct
35 Correct 28 ms 2636 KB Output is correct
36 Correct 174 ms 2636 KB Output is correct
37 Correct 28 ms 2684 KB Output is correct
38 Correct 177 ms 2636 KB Output is correct
39 Correct 28 ms 2636 KB Output is correct
40 Correct 177 ms 2636 KB Output is correct
41 Correct 28 ms 2636 KB Output is correct
42 Correct 178 ms 2740 KB Output is correct
43 Correct 28 ms 2744 KB Output is correct
44 Correct 175 ms 2672 KB Output is correct
45 Correct 28 ms 2636 KB Output is correct
46 Correct 176 ms 2744 KB Output is correct
47 Correct 4 ms 2636 KB Output is correct
48 Correct 91 ms 2636 KB Output is correct
49 Correct 91 ms 2636 KB Output is correct
50 Correct 188 ms 2636 KB Output is correct
51 Correct 184 ms 2740 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 4428 KB Output is correct
2 Correct 12 ms 4364 KB Output is correct
3 Correct 11 ms 4420 KB Output is correct
4 Correct 12 ms 4336 KB Output is correct
5 Correct 12 ms 4428 KB Output is correct
6 Correct 12 ms 4356 KB Output is correct
7 Correct 11 ms 4428 KB Output is correct
8 Correct 12 ms 4360 KB Output is correct
9 Correct 11 ms 4428 KB Output is correct
10 Correct 11 ms 4300 KB Output is correct
11 Correct 11 ms 4428 KB Output is correct
12 Correct 12 ms 4428 KB Output is correct
13 Correct 11 ms 4448 KB Output is correct
14 Correct 11 ms 4428 KB Output is correct
15 Correct 11 ms 4428 KB Output is correct
16 Correct 11 ms 4388 KB Output is correct
17 Correct 11 ms 4400 KB Output is correct
18 Correct 11 ms 4428 KB Output is correct
19 Correct 12 ms 4372 KB Output is correct
20 Correct 11 ms 4448 KB Output is correct
21 Correct 12 ms 4424 KB Output is correct
22 Correct 13 ms 4384 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2252 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 2 ms 2252 KB Output is correct
5 Correct 2 ms 2252 KB Output is correct
6 Correct 2 ms 2252 KB Output is correct
7 Correct 3 ms 2252 KB Output is correct
8 Correct 2 ms 2312 KB Output is correct
9 Correct 2 ms 2252 KB Output is correct
10 Correct 2 ms 2252 KB Output is correct
11 Correct 3 ms 2252 KB Output is correct
12 Correct 3 ms 2252 KB Output is correct
13 Correct 3 ms 2380 KB Output is correct
14 Correct 2 ms 2252 KB Output is correct
15 Correct 2 ms 2252 KB Output is correct
16 Correct 2 ms 2252 KB Output is correct
17 Correct 3 ms 2252 KB Output is correct
18 Correct 2 ms 2312 KB Output is correct
19 Correct 3 ms 2252 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2312 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2252 KB Output is correct
25 Correct 2 ms 2252 KB Output is correct
26 Correct 175 ms 2636 KB Output is correct
27 Correct 28 ms 2740 KB Output is correct
28 Correct 178 ms 2636 KB Output is correct
29 Correct 28 ms 2636 KB Output is correct
30 Correct 176 ms 2740 KB Output is correct
31 Correct 28 ms 2636 KB Output is correct
32 Correct 176 ms 2684 KB Output is correct
33 Correct 31 ms 2636 KB Output is correct
34 Correct 17 ms 2836 KB Output is correct
35 Correct 28 ms 2636 KB Output is correct
36 Correct 174 ms 2636 KB Output is correct
37 Correct 28 ms 2684 KB Output is correct
38 Correct 177 ms 2636 KB Output is correct
39 Correct 28 ms 2636 KB Output is correct
40 Correct 177 ms 2636 KB Output is correct
41 Correct 28 ms 2636 KB Output is correct
42 Correct 178 ms 2740 KB Output is correct
43 Correct 28 ms 2744 KB Output is correct
44 Correct 175 ms 2672 KB Output is correct
45 Correct 28 ms 2636 KB Output is correct
46 Correct 176 ms 2744 KB Output is correct
47 Correct 4 ms 2636 KB Output is correct
48 Correct 91 ms 2636 KB Output is correct
49 Correct 91 ms 2636 KB Output is correct
50 Correct 188 ms 2636 KB Output is correct
51 Correct 184 ms 2740 KB Output is correct
52 Correct 12 ms 4428 KB Output is correct
53 Correct 12 ms 4364 KB Output is correct
54 Correct 11 ms 4420 KB Output is correct
55 Correct 12 ms 4336 KB Output is correct
56 Correct 12 ms 4428 KB Output is correct
57 Correct 12 ms 4356 KB Output is correct
58 Correct 11 ms 4428 KB Output is correct
59 Correct 12 ms 4360 KB Output is correct
60 Correct 11 ms 4428 KB Output is correct
61 Correct 11 ms 4300 KB Output is correct
62 Correct 11 ms 4428 KB Output is correct
63 Correct 12 ms 4428 KB Output is correct
64 Correct 11 ms 4448 KB Output is correct
65 Correct 11 ms 4428 KB Output is correct
66 Correct 11 ms 4428 KB Output is correct
67 Correct 11 ms 4388 KB Output is correct
68 Correct 11 ms 4400 KB Output is correct
69 Correct 11 ms 4428 KB Output is correct
70 Correct 12 ms 4372 KB Output is correct
71 Correct 11 ms 4448 KB Output is correct
72 Correct 12 ms 4424 KB Output is correct
73 Correct 13 ms 4384 KB Output is correct
74 Runtime error 5 ms 4556 KB Execution killed with signal 11
75 Halted 0 ms 0 KB -