oj.uz

Submission #94121

# Submission time Handle Problem Language Result Execution time Memory
94121 2019-01-16T10:34:59 Z Kastanda Tug of War (BOI15_tug) C++11
71 / 100
 72 ms 7288 KB 
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N = 30004, MXN = N * 20;
int n, k, L[N], R[N], A[N], C[MXN];
bool M[N * 2];
set < int > Adj[N * 2];
bitset < MXN > B;
int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n + n; i++)
    {
        scanf("%d%d%d", &L[i], &R[i], &A[i]);
        R[i] += n;
        Adj[L[i]].insert(i);
        Adj[R[i]].insert(i);
    }
    for (int i = 1; i <= n + n; i++)
        if (!Adj[i].size())
            return !printf("NO");

    queue < int > qu;
    for (int i = 1; i <= n + n; i++)
        if ((int)Adj[i].size() == 1)
            qu.push(i);

    int L_sum = 0, R_sum = 0;
    while (qu.size())
    {
        int v = qu.front(); qu.pop();
        assert((int)Adj[v].size() == 1);
        int id = * Adj[v].begin();
      	Adj[v].erase(Adj[v].begin());
        int u = L[id] ^ R[id] ^ v;
        M[v] = 1;

        if (v <= n)
            L_sum += A[id];
        else
            R_sum += A[id];

        if (M[u]) return !printf("NO");
        Adj[u].erase(id);
        if ((int)Adj[u].size() == 1)
            qu.push(u);
        if (Adj[u].size() == 0)
            return !printf("NO");
    }

    int sum = 0;
    memset(M, 0, sizeof(M));
    for (int i = 1; i <= n + n; i++)
        if (!M[i])
        {
            int v = i, p = 0, _sum = 0;
            while (!M[v])
            {
                M[v] = 1;
                Adj[v].erase(p);
                int id = * Adj[v].begin();
                int u = L[id] ^ R[id] ^ v;
                _sum = -_sum + A[id];
                p = id; v = u;
            }
            sum += abs(_sum);
            C[abs(_sum)] ++;
        }
    for (int i = 1; i < MXN; i++)
        if (C[i] > 2)
        {
            C[i + i] += (C[i] - 1) >> 1;
            C[i] = (C[i] - 1 & 1) + 1;
        }
    B = 1;
    for (int i = 1; i < MXN; i++)
        for (int j = 1; j <= C[i]; j++)
            B |= B << i;

    sum += L_sum - R_sum;
    for (int i = 0; i < MXN; i++)
        if (B[i] && abs(sum - i - i) <= k)
            return !printf("YES");
    return !printf("NO");
}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:73:26: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
             C[i] = (C[i] - 1 & 1) + 1;
                     ~~~~~^~~
tug.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
tug.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &L[i], &R[i], &A[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3448 KB Output is correct
2 Correct 6 ms 3452 KB Output is correct
3 Correct 8 ms 3448 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 8 ms 3448 KB Output is correct
6 Correct 7 ms 3452 KB Output is correct
7 Correct 7 ms 3448 KB Output is correct
8 Correct 7 ms 3448 KB Output is correct
9 Correct 7 ms 3448 KB Output is correct
10 Correct 8 ms 3448 KB Output is correct
11 Correct 7 ms 3576 KB Output is correct
12 Correct 7 ms 3448 KB Output is correct
13 Correct 7 ms 3448 KB Output is correct
14 Correct 6 ms 3448 KB Output is correct
15 Correct 7 ms 3452 KB Output is correct
16 Correct 7 ms 3448 KB Output is correct
17 Correct 7 ms 3452 KB Output is correct
18 Correct 6 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 6 ms 3448 KB Output is correct
21 Correct 4 ms 3192 KB Output is correct
22 Correct 6 ms 3448 KB Output is correct
23 Correct 7 ms 3448 KB Output is correct
24 Correct 6 ms 3448 KB Output is correct
25 Correct 7 ms 3576 KB Output is correct
26 Correct 12 ms 3904 KB Output is correct
27 Correct 18 ms 3832 KB Output is correct
28 Correct 12 ms 3832 KB Output is correct
29 Correct 72 ms 3960 KB Output is correct
30 Correct 13 ms 3832 KB Output is correct
31 Correct 19 ms 3832 KB Output is correct
32 Correct 12 ms 3960 KB Output is correct
33 Correct 17 ms 3960 KB Output is correct
34 Correct 10 ms 3960 KB Output is correct
35 Correct 18 ms 3960 KB Output is correct
36 Correct 13 ms 3960 KB Output is correct
37 Correct 19 ms 3832 KB Output is correct
38 Correct 15 ms 3832 KB Output is correct
39 Correct 19 ms 3960 KB Output is correct
40 Correct 12 ms 3960 KB Output is correct
41 Correct 18 ms 3960 KB Output is correct
42 Correct 13 ms 3960 KB Output is correct
43 Correct 18 ms 3960 KB Output is correct
44 Correct 12 ms 3960 KB Output is correct
45 Correct 19 ms 3832 KB Output is correct
46 Correct 12 ms 3960 KB Output is correct
47 Correct 6 ms 3704 KB Output is correct
48 Correct 12 ms 3960 KB Output is correct
49 Correct 12 ms 3960 KB Output is correct
50 Correct 10 ms 3832 KB Output is correct
51 Correct 12 ms 3960 KB Output is correct

Subtask #3
23.0 / 23.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3448 KB Output is correct
2 Correct 6 ms 3452 KB Output is correct
3 Correct 8 ms 3448 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 8 ms 3448 KB Output is correct
6 Correct 7 ms 3452 KB Output is correct
7 Correct 7 ms 3448 KB Output is correct
8 Correct 7 ms 3448 KB Output is correct
9 Correct 7 ms 3448 KB Output is correct
10 Correct 8 ms 3448 KB Output is correct
11 Correct 7 ms 3576 KB Output is correct
12 Correct 7 ms 3448 KB Output is correct
13 Correct 7 ms 3448 KB Output is correct
14 Correct 6 ms 3448 KB Output is correct
15 Correct 7 ms 3452 KB Output is correct
16 Correct 7 ms 3448 KB Output is correct
17 Correct 7 ms 3452 KB Output is correct
18 Correct 6 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 6 ms 3448 KB Output is correct
21 Correct 4 ms 3192 KB Output is correct
22 Correct 6 ms 3448 KB Output is correct
23 Correct 7 ms 3448 KB Output is correct
24 Correct 6 ms 3448 KB Output is correct
25 Correct 7 ms 3576 KB Output is correct
26 Correct 12 ms 3904 KB Output is correct
27 Correct 18 ms 3832 KB Output is correct
28 Correct 12 ms 3832 KB Output is correct
29 Correct 72 ms 3960 KB Output is correct
30 Correct 13 ms 3832 KB Output is correct
31 Correct 19 ms 3832 KB Output is correct
32 Correct 12 ms 3960 KB Output is correct
33 Correct 17 ms 3960 KB Output is correct
34 Correct 10 ms 3960 KB Output is correct
35 Correct 18 ms 3960 KB Output is correct
36 Correct 13 ms 3960 KB Output is correct
37 Correct 19 ms 3832 KB Output is correct
38 Correct 15 ms 3832 KB Output is correct
39 Correct 19 ms 3960 KB Output is correct
40 Correct 12 ms 3960 KB Output is correct
41 Correct 18 ms 3960 KB Output is correct
42 Correct 13 ms 3960 KB Output is correct
43 Correct 18 ms 3960 KB Output is correct
44 Correct 12 ms 3960 KB Output is correct
45 Correct 19 ms 3832 KB Output is correct
46 Correct 12 ms 3960 KB Output is correct
47 Correct 6 ms 3704 KB Output is correct
48 Correct 12 ms 3960 KB Output is correct
49 Correct 12 ms 3960 KB Output is correct
50 Correct 10 ms 3832 KB Output is correct
51 Correct 12 ms 3960 KB Output is correct
52 Correct 21 ms 5480 KB Output is correct
53 Correct 17 ms 5240 KB Output is correct
54 Correct 20 ms 5496 KB Output is correct
55 Correct 16 ms 5240 KB Output is correct
56 Correct 19 ms 5496 KB Output is correct
57 Correct 14 ms 5240 KB Output is correct
58 Correct 19 ms 5496 KB Output is correct
59 Correct 14 ms 5240 KB Output is correct
60 Correct 17 ms 5496 KB Output is correct
61 Correct 15 ms 5368 KB Output is correct
62 Correct 17 ms 5496 KB Output is correct
63 Correct 15 ms 5212 KB Output is correct
64 Correct 18 ms 5496 KB Output is correct
65 Correct 18 ms 5500 KB Output is correct
66 Correct 17 ms 5240 KB Output is correct
67 Correct 19 ms 5556 KB Output is correct
68 Correct 14 ms 5240 KB Output is correct
69 Correct 18 ms 5496 KB Output is correct
70 Correct 15 ms 5240 KB Output is correct
71 Correct 17 ms 5496 KB Output is correct
72 Correct 14 ms 5240 KB Output is correct
73 Correct 19 ms 5496 KB Output is correct
74 Execution timed out 21 ms 7288 KB Time limit exceeded (wall clock)
75 Halted 0 ms 0 KB -