Submission #30934

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
30934	2017-08-01T08:12:24 Z	Navick	Tug of War (BOI15_tug)	C++14	48 / 100	1803 ms	8948 KB

#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 3e4 + 10, K = 20;

int n, k, deg[2 * N], suml, sumr, sum, p[N];
vector<int> adj[4 * N];
bool mark[4 * N];
set<pii> s;
pii vl[4 * N];
bitset<2 * N * K> dp, foo;

inline int pe(int i){
	return 2 * n + i;
}

inline int rg(int i){
	return i + n;
}

inline int lf(int i){
	return i;
}

void dfs(int v, int c, int h = 0){
	mark[v] = true;
	if(v>=2*n){
		if(h % 4 == 1)
			vl[c].F += p[v];
		else
			vl[c].S += p[v];
	}
	for(auto u : adj[v]){
		if(mark[u])continue;
		dfs(u, c, h + 1);
	}
}

int main(){
	scanf("%d %d", &n, &k);
	for(int i=0; i<2*n; i++){
		int l, r; scanf("%d %d", &l, &r);
		--l; --r;
		
		scanf("%d", &p[pe(i)]); sum += p[pe(i)];

		adj[pe(i)].pb(lf(l));
		adj[pe(i)].pb(rg(r));
		adj[rg(r)].pb(pe(i));
		adj[lf(l)].pb(pe(i));
	}

	for(int i=0; i<2*n; i++){
		deg[i] = (int)adj[i].size();
		s.insert({deg[i], i});
	}

	while(!s.empty()){
		int v = (*s.begin()).S;
		s.erase(s.begin());
		
		if(deg[v] <= 0)
			return printf("NO\n"), 0;

		if(deg[v] == 1){
			mark[v] = true;
			for(auto u : adj[v]){
				if(mark[u])continue;
				mark[u] = true;
				for(auto x : adj[u]){
					if(mark[x])continue;
					s.erase({deg[x], x});
					deg[x]--;
					s.insert({deg[x], x});
				}
				if(v < n)
					suml += p[u];
				else sumr += p[u];
			}
		}
		else break;
	}

	int cnt = 0;

	for(int i=0; i<2*n; i++){
		if(mark[i])continue;
		dfs(i, cnt);
		cnt++;
	}

	dp[suml] = 1;
	for(int i=0; i<cnt; i++){
		foo = dp;
		dp.reset();
		dp |= foo << (vl[i].F);
		dp |= foo << (vl[i].S);
	}

	for(int i=(sum-k+1)/2; i<=(sum+k)/2; i++)
		if(dp[i])
			return printf("YES\n"), 0;
	return printf("NO\n"), 0;
	
}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:48:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
                        ^
tug.cpp:50:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int l, r; scanf("%d %d", &l, &r);
                                   ^
tug.cpp:53:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p[pe(i)]); sum += p[pe(i)];
                         ^

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	6704 KB	Output is correct
2	Correct	3 ms	6704 KB	Output is correct
3	Correct	0 ms	6708 KB	Output is correct
4	Correct	0 ms	6704 KB	Output is correct
5	Correct	3 ms	6704 KB	Output is correct
6	Correct	0 ms	6704 KB	Output is correct
7	Correct	3 ms	6708 KB	Output is correct
8	Correct	3 ms	6708 KB	Output is correct
9	Correct	3 ms	6708 KB	Output is correct
10	Correct	0 ms	6704 KB	Output is correct
11	Correct	3 ms	6704 KB	Output is correct
12	Correct	3 ms	6708 KB	Output is correct
13	Correct	3 ms	6708 KB	Output is correct
14	Correct	3 ms	6708 KB	Output is correct
15	Correct	3 ms	6712 KB	Output is correct
16	Correct	3 ms	6704 KB	Output is correct
17	Correct	3 ms	6712 KB	Output is correct
18	Correct	0 ms	6708 KB	Output is correct
19	Correct	0 ms	6704 KB	Output is correct
20	Correct	3 ms	6704 KB	Output is correct
21	Correct	0 ms	6712 KB	Output is correct
22	Correct	3 ms	6708 KB	Output is correct
23	Correct	0 ms	6708 KB	Output is correct
24	Correct	3 ms	6704 KB	Output is correct
25	Correct	0 ms	6704 KB	Output is correct
26	Correct	339 ms	7100 KB	Output is correct
27	Correct	53 ms	7104 KB	Output is correct
28	Correct	369 ms	7104 KB	Output is correct
29	Correct	46 ms	7100 KB	Output is correct
30	Correct	376 ms	7104 KB	Output is correct
31	Correct	53 ms	7104 KB	Output is correct
32	Correct	376 ms	7100 KB	Output is correct
33	Correct	53 ms	7100 KB	Output is correct
34	Correct	26 ms	7112 KB	Output is correct
35	Correct	46 ms	7104 KB	Output is correct
36	Correct	359 ms	7104 KB	Output is correct
37	Correct	49 ms	7100 KB	Output is correct
38	Correct	359 ms	7100 KB	Output is correct
39	Correct	56 ms	7100 KB	Output is correct
40	Correct	379 ms	7100 KB	Output is correct
41	Correct	53 ms	7100 KB	Output is correct
42	Correct	366 ms	7100 KB	Output is correct
43	Correct	53 ms	7104 KB	Output is correct
44	Correct	363 ms	7100 KB	Output is correct
45	Correct	49 ms	7104 KB	Output is correct
46	Correct	363 ms	7100 KB	Output is correct
47	Correct	3 ms	7100 KB	Output is correct
48	Correct	193 ms	7104 KB	Output is correct
49	Correct	209 ms	7100 KB	Output is correct
50	Correct	373 ms	7108 KB	Output is correct
51	Correct	363 ms	7104 KB	Output is correct

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1803 ms	8948 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	6704 KB	Output is correct
2	Correct	3 ms	6704 KB	Output is correct
3	Correct	0 ms	6708 KB	Output is correct
4	Correct	0 ms	6704 KB	Output is correct
5	Correct	3 ms	6704 KB	Output is correct
6	Correct	0 ms	6704 KB	Output is correct
7	Correct	3 ms	6708 KB	Output is correct
8	Correct	3 ms	6708 KB	Output is correct
9	Correct	3 ms	6708 KB	Output is correct
10	Correct	0 ms	6704 KB	Output is correct
11	Correct	3 ms	6704 KB	Output is correct
12	Correct	3 ms	6708 KB	Output is correct
13	Correct	3 ms	6708 KB	Output is correct
14	Correct	3 ms	6708 KB	Output is correct
15	Correct	3 ms	6712 KB	Output is correct
16	Correct	3 ms	6704 KB	Output is correct
17	Correct	3 ms	6712 KB	Output is correct
18	Correct	0 ms	6708 KB	Output is correct
19	Correct	0 ms	6704 KB	Output is correct
20	Correct	3 ms	6704 KB	Output is correct
21	Correct	0 ms	6712 KB	Output is correct
22	Correct	3 ms	6708 KB	Output is correct
23	Correct	0 ms	6708 KB	Output is correct
24	Correct	3 ms	6704 KB	Output is correct
25	Correct	0 ms	6704 KB	Output is correct
26	Correct	339 ms	7100 KB	Output is correct
27	Correct	53 ms	7104 KB	Output is correct
28	Correct	369 ms	7104 KB	Output is correct
29	Correct	46 ms	7100 KB	Output is correct
30	Correct	376 ms	7104 KB	Output is correct
31	Correct	53 ms	7104 KB	Output is correct
32	Correct	376 ms	7100 KB	Output is correct
33	Correct	53 ms	7100 KB	Output is correct
34	Correct	26 ms	7112 KB	Output is correct
35	Correct	46 ms	7104 KB	Output is correct
36	Correct	359 ms	7104 KB	Output is correct
37	Correct	49 ms	7100 KB	Output is correct
38	Correct	359 ms	7100 KB	Output is correct
39	Correct	56 ms	7100 KB	Output is correct
40	Correct	379 ms	7100 KB	Output is correct
41	Correct	53 ms	7100 KB	Output is correct
42	Correct	366 ms	7100 KB	Output is correct
43	Correct	53 ms	7104 KB	Output is correct
44	Correct	363 ms	7100 KB	Output is correct
45	Correct	49 ms	7104 KB	Output is correct
46	Correct	363 ms	7100 KB	Output is correct
47	Correct	3 ms	7100 KB	Output is correct
48	Correct	193 ms	7104 KB	Output is correct
49	Correct	209 ms	7100 KB	Output is correct
50	Correct	373 ms	7108 KB	Output is correct
51	Correct	363 ms	7104 KB	Output is correct
52	Incorrect	1803 ms	8948 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

Submission #30934

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 23.0

Subtask #4 0 / 29.0

Subtask #1
18.0 / 18.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 23.0

Subtask #4
0 / 29.0