답안 #94122 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94122	2019-01-16T10:40:00 Z	Kastanda	Tug of War (BOI15_tug)	C++11	100 / 100	156 ms	13944 KB

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#define pb push_back
using namespace std;
const int N = 60004, 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 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)
            sum += A[id];
        else
            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");
    }

    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;

    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:12: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:15: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

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	6520 KB	Output is correct
2	Correct	14 ms	6520 KB	Output is correct
3	Correct	14 ms	6520 KB	Output is correct
4	Correct	11 ms	6520 KB	Output is correct
5	Correct	13 ms	6520 KB	Output is correct
6	Correct	13 ms	6520 KB	Output is correct
7	Correct	11 ms	6520 KB	Output is correct
8	Correct	11 ms	6520 KB	Output is correct
9	Correct	11 ms	6520 KB	Output is correct
10	Correct	13 ms	6520 KB	Output is correct
11	Correct	11 ms	6520 KB	Output is correct
12	Correct	13 ms	6580 KB	Output is correct
13	Correct	13 ms	6520 KB	Output is correct
14	Correct	11 ms	6520 KB	Output is correct
15	Correct	11 ms	6520 KB	Output is correct
16	Correct	15 ms	6520 KB	Output is correct
17	Correct	12 ms	6520 KB	Output is correct
18	Correct	11 ms	6524 KB	Output is correct
19	Correct	11 ms	6520 KB	Output is correct
20	Correct	12 ms	6520 KB	Output is correct
21	Correct	5 ms	6008 KB	Output is correct
22	Correct	13 ms	6520 KB	Output is correct
23	Correct	12 ms	6520 KB	Output is correct
24	Correct	13 ms	6520 KB	Output is correct
25	Correct	14 ms	6520 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	6520 KB	Output is correct
2	Correct	14 ms	6520 KB	Output is correct
3	Correct	14 ms	6520 KB	Output is correct
4	Correct	11 ms	6520 KB	Output is correct
5	Correct	13 ms	6520 KB	Output is correct
6	Correct	13 ms	6520 KB	Output is correct
7	Correct	11 ms	6520 KB	Output is correct
8	Correct	11 ms	6520 KB	Output is correct
9	Correct	11 ms	6520 KB	Output is correct
10	Correct	13 ms	6520 KB	Output is correct
11	Correct	11 ms	6520 KB	Output is correct
12	Correct	13 ms	6580 KB	Output is correct
13	Correct	13 ms	6520 KB	Output is correct
14	Correct	11 ms	6520 KB	Output is correct
15	Correct	11 ms	6520 KB	Output is correct
16	Correct	15 ms	6520 KB	Output is correct
17	Correct	12 ms	6520 KB	Output is correct
18	Correct	11 ms	6524 KB	Output is correct
19	Correct	11 ms	6520 KB	Output is correct
20	Correct	12 ms	6520 KB	Output is correct
21	Correct	5 ms	6008 KB	Output is correct
22	Correct	13 ms	6520 KB	Output is correct
23	Correct	12 ms	6520 KB	Output is correct
24	Correct	13 ms	6520 KB	Output is correct
25	Correct	14 ms	6520 KB	Output is correct
26	Correct	21 ms	6904 KB	Output is correct
27	Correct	33 ms	6904 KB	Output is correct
28	Correct	20 ms	6904 KB	Output is correct
29	Correct	33 ms	7032 KB	Output is correct
30	Correct	22 ms	6904 KB	Output is correct
31	Correct	33 ms	6904 KB	Output is correct
32	Correct	20 ms	6976 KB	Output is correct
33	Correct	34 ms	7032 KB	Output is correct
34	Correct	17 ms	7032 KB	Output is correct
35	Correct	33 ms	6904 KB	Output is correct
36	Correct	20 ms	7004 KB	Output is correct
37	Correct	33 ms	6904 KB	Output is correct
38	Correct	21 ms	7032 KB	Output is correct
39	Correct	31 ms	7036 KB	Output is correct
40	Correct	21 ms	6904 KB	Output is correct
41	Correct	31 ms	6904 KB	Output is correct
42	Correct	22 ms	6904 KB	Output is correct
43	Correct	34 ms	7032 KB	Output is correct
44	Correct	20 ms	6908 KB	Output is correct
45	Correct	32 ms	6904 KB	Output is correct
46	Correct	20 ms	6948 KB	Output is correct
47	Correct	8 ms	6392 KB	Output is correct
48	Correct	20 ms	6904 KB	Output is correct
49	Correct	21 ms	6904 KB	Output is correct
50	Correct	17 ms	6904 KB	Output is correct
51	Correct	20 ms	6904 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	8548 KB	Output is correct
2	Correct	20 ms	8056 KB	Output is correct
3	Correct	22 ms	8568 KB	Output is correct
4	Correct	22 ms	8100 KB	Output is correct
5	Correct	26 ms	8440 KB	Output is correct
6	Correct	20 ms	8112 KB	Output is correct
7	Correct	29 ms	8440 KB	Output is correct
8	Correct	20 ms	8056 KB	Output is correct
9	Correct	26 ms	8440 KB	Output is correct
10	Correct	22 ms	8148 KB	Output is correct
11	Correct	28 ms	8440 KB	Output is correct
12	Correct	17 ms	8056 KB	Output is correct
13	Correct	28 ms	8440 KB	Output is correct
14	Correct	28 ms	8440 KB	Output is correct
15	Correct	17 ms	8056 KB	Output is correct
16	Correct	25 ms	8440 KB	Output is correct
17	Correct	19 ms	8056 KB	Output is correct
18	Correct	51 ms	8440 KB	Output is correct
19	Correct	19 ms	8184 KB	Output is correct
20	Correct	25 ms	8440 KB	Output is correct
21	Correct	20 ms	8056 KB	Output is correct
22	Correct	24 ms	8568 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	6520 KB	Output is correct
2	Correct	14 ms	6520 KB	Output is correct
3	Correct	14 ms	6520 KB	Output is correct
4	Correct	11 ms	6520 KB	Output is correct
5	Correct	13 ms	6520 KB	Output is correct
6	Correct	13 ms	6520 KB	Output is correct
7	Correct	11 ms	6520 KB	Output is correct
8	Correct	11 ms	6520 KB	Output is correct
9	Correct	11 ms	6520 KB	Output is correct
10	Correct	13 ms	6520 KB	Output is correct
11	Correct	11 ms	6520 KB	Output is correct
12	Correct	13 ms	6580 KB	Output is correct
13	Correct	13 ms	6520 KB	Output is correct
14	Correct	11 ms	6520 KB	Output is correct
15	Correct	11 ms	6520 KB	Output is correct
16	Correct	15 ms	6520 KB	Output is correct
17	Correct	12 ms	6520 KB	Output is correct
18	Correct	11 ms	6524 KB	Output is correct
19	Correct	11 ms	6520 KB	Output is correct
20	Correct	12 ms	6520 KB	Output is correct
21	Correct	5 ms	6008 KB	Output is correct
22	Correct	13 ms	6520 KB	Output is correct
23	Correct	12 ms	6520 KB	Output is correct
24	Correct	13 ms	6520 KB	Output is correct
25	Correct	14 ms	6520 KB	Output is correct
26	Correct	21 ms	6904 KB	Output is correct
27	Correct	33 ms	6904 KB	Output is correct
28	Correct	20 ms	6904 KB	Output is correct
29	Correct	33 ms	7032 KB	Output is correct
30	Correct	22 ms	6904 KB	Output is correct
31	Correct	33 ms	6904 KB	Output is correct
32	Correct	20 ms	6976 KB	Output is correct
33	Correct	34 ms	7032 KB	Output is correct
34	Correct	17 ms	7032 KB	Output is correct
35	Correct	33 ms	6904 KB	Output is correct
36	Correct	20 ms	7004 KB	Output is correct
37	Correct	33 ms	6904 KB	Output is correct
38	Correct	21 ms	7032 KB	Output is correct
39	Correct	31 ms	7036 KB	Output is correct
40	Correct	21 ms	6904 KB	Output is correct
41	Correct	31 ms	6904 KB	Output is correct
42	Correct	22 ms	6904 KB	Output is correct
43	Correct	34 ms	7032 KB	Output is correct
44	Correct	20 ms	6908 KB	Output is correct
45	Correct	32 ms	6904 KB	Output is correct
46	Correct	20 ms	6948 KB	Output is correct
47	Correct	8 ms	6392 KB	Output is correct
48	Correct	20 ms	6904 KB	Output is correct
49	Correct	21 ms	6904 KB	Output is correct
50	Correct	17 ms	6904 KB	Output is correct
51	Correct	20 ms	6904 KB	Output is correct
52	Correct	26 ms	8548 KB	Output is correct
53	Correct	20 ms	8056 KB	Output is correct
54	Correct	22 ms	8568 KB	Output is correct
55	Correct	22 ms	8100 KB	Output is correct
56	Correct	26 ms	8440 KB	Output is correct
57	Correct	20 ms	8112 KB	Output is correct
58	Correct	29 ms	8440 KB	Output is correct
59	Correct	20 ms	8056 KB	Output is correct
60	Correct	26 ms	8440 KB	Output is correct
61	Correct	22 ms	8148 KB	Output is correct
62	Correct	28 ms	8440 KB	Output is correct
63	Correct	17 ms	8056 KB	Output is correct
64	Correct	28 ms	8440 KB	Output is correct
65	Correct	28 ms	8440 KB	Output is correct
66	Correct	17 ms	8056 KB	Output is correct
67	Correct	25 ms	8440 KB	Output is correct
68	Correct	19 ms	8056 KB	Output is correct
69	Correct	51 ms	8440 KB	Output is correct
70	Correct	19 ms	8184 KB	Output is correct
71	Correct	25 ms	8440 KB	Output is correct
72	Correct	20 ms	8056 KB	Output is correct
73	Correct	24 ms	8568 KB	Output is correct
74	Correct	95 ms	13048 KB	Output is correct
75	Correct	131 ms	13708 KB	Output is correct
76	Correct	69 ms	13740 KB	Output is correct
77	Correct	136 ms	13688 KB	Output is correct
78	Correct	66 ms	13688 KB	Output is correct
79	Correct	77 ms	13944 KB	Output is correct
80	Correct	134 ms	13788 KB	Output is correct
81	Correct	64 ms	13688 KB	Output is correct
82	Correct	43 ms	13816 KB	Output is correct
83	Correct	69 ms	13692 KB	Output is correct
84	Correct	130 ms	13820 KB	Output is correct
85	Correct	70 ms	13688 KB	Output is correct
86	Correct	137 ms	13816 KB	Output is correct
87	Correct	64 ms	13688 KB	Output is correct
88	Correct	124 ms	13748 KB	Output is correct
89	Correct	62 ms	13688 KB	Output is correct
90	Correct	122 ms	13692 KB	Output is correct
91	Correct	62 ms	13816 KB	Output is correct
92	Correct	156 ms	13816 KB	Output is correct
93	Correct	72 ms	13688 KB	Output is correct
94	Correct	56 ms	13048 KB	Output is correct
95	Correct	72 ms	13816 KB	Output is correct
96	Correct	101 ms	13800 KB	Output is correct
97	Correct	64 ms	13688 KB	Output is correct
98	Correct	66 ms	13688 KB	Output is correct

답안 #94122

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 30.0 / 30.0

Subtask #3 23.0 / 23.0

Subtask #4 29.0 / 29.0

Subtask #1
18.0 / 18.0

Subtask #2
30.0 / 30.0

Subtask #3
23.0 / 23.0

Subtask #4
29.0 / 29.0