oj.uz

Submission #30933

# Submission time Handle Problem Language Result Execution time Memory
30933 2017-08-01T08:05:12 Z Navick Tug of War (BOI15_tug) C++14
71 / 100
 296 ms 8940 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 = 30;

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<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;
	}

	if(n > 2000)return printf("YES\n"), 0;

	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 3 ms 6560 KB Output is correct
2 Correct 3 ms 6564 KB Output is correct
3 Correct 3 ms 6560 KB Output is correct
4 Correct 3 ms 6560 KB Output is correct
5 Correct 3 ms 6560 KB Output is correct
6 Correct 0 ms 6564 KB Output is correct
7 Correct 0 ms 6564 KB Output is correct
8 Correct 0 ms 6556 KB Output is correct
9 Correct 0 ms 6564 KB Output is correct
10 Correct 0 ms 6564 KB Output is correct
11 Correct 3 ms 6556 KB Output is correct
12 Correct 0 ms 6560 KB Output is correct
13 Correct 0 ms 6564 KB Output is correct
14 Correct 3 ms 6560 KB Output is correct
15 Correct 0 ms 6560 KB Output is correct
16 Correct 0 ms 6560 KB Output is correct
17 Correct 3 ms 6560 KB Output is correct
18 Correct 0 ms 6560 KB Output is correct
19 Correct 0 ms 6560 KB Output is correct
20 Correct 3 ms 6564 KB Output is correct
21 Correct 0 ms 6564 KB Output is correct
22 Correct 0 ms 6560 KB Output is correct
23 Correct 0 ms 6564 KB Output is correct
24 Correct 3 ms 6560 KB Output is correct
25 Correct 0 ms 6560 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6560 KB Output is correct
2 Correct 3 ms 6564 KB Output is correct
3 Correct 3 ms 6560 KB Output is correct
4 Correct 3 ms 6560 KB Output is correct
5 Correct 3 ms 6560 KB Output is correct
6 Correct 0 ms 6564 KB Output is correct
7 Correct 0 ms 6564 KB Output is correct
8 Correct 0 ms 6556 KB Output is correct
9 Correct 0 ms 6564 KB Output is correct
10 Correct 0 ms 6564 KB Output is correct
11 Correct 3 ms 6556 KB Output is correct
12 Correct 0 ms 6560 KB Output is correct
13 Correct 0 ms 6564 KB Output is correct
14 Correct 3 ms 6560 KB Output is correct
15 Correct 0 ms 6560 KB Output is correct
16 Correct 0 ms 6560 KB Output is correct
17 Correct 3 ms 6560 KB Output is correct
18 Correct 0 ms 6560 KB Output is correct
19 Correct 0 ms 6560 KB Output is correct
20 Correct 3 ms 6564 KB Output is correct
21 Correct 0 ms 6564 KB Output is correct
22 Correct 0 ms 6560 KB Output is correct
23 Correct 0 ms 6564 KB Output is correct
24 Correct 3 ms 6560 KB Output is correct
25 Correct 0 ms 6560 KB Output is correct
26 Correct 273 ms 6956 KB Output is correct
27 Correct 36 ms 6956 KB Output is correct
28 Correct 266 ms 6960 KB Output is correct
29 Correct 36 ms 6956 KB Output is correct
30 Correct 246 ms 6960 KB Output is correct
31 Correct 43 ms 6952 KB Output is correct
32 Correct 269 ms 6956 KB Output is correct
33 Correct 36 ms 6956 KB Output is correct
34 Correct 23 ms 6964 KB Output is correct
35 Correct 33 ms 6960 KB Output is correct
36 Correct 263 ms 6956 KB Output is correct
37 Correct 33 ms 6956 KB Output is correct
38 Correct 256 ms 6956 KB Output is correct
39 Correct 39 ms 6960 KB Output is correct
40 Correct 259 ms 6956 KB Output is correct
41 Correct 39 ms 6956 KB Output is correct
42 Correct 283 ms 6956 KB Output is correct
43 Correct 36 ms 6956 KB Output is correct
44 Correct 266 ms 6960 KB Output is correct
45 Correct 39 ms 6960 KB Output is correct
46 Correct 296 ms 6956 KB Output is correct
47 Correct 3 ms 6956 KB Output is correct
48 Correct 136 ms 6956 KB Output is correct
49 Correct 146 ms 6952 KB Output is correct
50 Correct 286 ms 6960 KB Output is correct
51 Correct 266 ms 6960 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8804 KB Output is correct
2 Correct 19 ms 8804 KB Output is correct
3 Correct 16 ms 8804 KB Output is correct
4 Correct 26 ms 8804 KB Output is correct
5 Correct 19 ms 8808 KB Output is correct
6 Correct 23 ms 8808 KB Output is correct
7 Correct 29 ms 8808 KB Output is correct
8 Correct 23 ms 8800 KB Output is correct
9 Correct 29 ms 8808 KB Output is correct
10 Correct 16 ms 8808 KB Output is correct
11 Correct 23 ms 8804 KB Output is correct
12 Correct 26 ms 8804 KB Output is correct
13 Correct 23 ms 8808 KB Output is correct
14 Correct 19 ms 8808 KB Output is correct
15 Correct 19 ms 8804 KB Output is correct
16 Correct 19 ms 8808 KB Output is correct
17 Correct 26 ms 8804 KB Output is correct
18 Correct 19 ms 8804 KB Output is correct
19 Correct 19 ms 8804 KB Output is correct
20 Correct 29 ms 8804 KB Output is correct
21 Correct 16 ms 8676 KB Output is correct
22 Correct 26 ms 8804 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6560 KB Output is correct
2 Correct 3 ms 6564 KB Output is correct
3 Correct 3 ms 6560 KB Output is correct
4 Correct 3 ms 6560 KB Output is correct
5 Correct 3 ms 6560 KB Output is correct
6 Correct 0 ms 6564 KB Output is correct
7 Correct 0 ms 6564 KB Output is correct
8 Correct 0 ms 6556 KB Output is correct
9 Correct 0 ms 6564 KB Output is correct
10 Correct 0 ms 6564 KB Output is correct
11 Correct 3 ms 6556 KB Output is correct
12 Correct 0 ms 6560 KB Output is correct
13 Correct 0 ms 6564 KB Output is correct
14 Correct 3 ms 6560 KB Output is correct
15 Correct 0 ms 6560 KB Output is correct
16 Correct 0 ms 6560 KB Output is correct
17 Correct 3 ms 6560 KB Output is correct
18 Correct 0 ms 6560 KB Output is correct
19 Correct 0 ms 6560 KB Output is correct
20 Correct 3 ms 6564 KB Output is correct
21 Correct 0 ms 6564 KB Output is correct
22 Correct 0 ms 6560 KB Output is correct
23 Correct 0 ms 6564 KB Output is correct
24 Correct 3 ms 6560 KB Output is correct
25 Correct 0 ms 6560 KB Output is correct
26 Correct 273 ms 6956 KB Output is correct
27 Correct 36 ms 6956 KB Output is correct
28 Correct 266 ms 6960 KB Output is correct
29 Correct 36 ms 6956 KB Output is correct
30 Correct 246 ms 6960 KB Output is correct
31 Correct 43 ms 6952 KB Output is correct
32 Correct 269 ms 6956 KB Output is correct
33 Correct 36 ms 6956 KB Output is correct
34 Correct 23 ms 6964 KB Output is correct
35 Correct 33 ms 6960 KB Output is correct
36 Correct 263 ms 6956 KB Output is correct
37 Correct 33 ms 6956 KB Output is correct
38 Correct 256 ms 6956 KB Output is correct
39 Correct 39 ms 6960 KB Output is correct
40 Correct 259 ms 6956 KB Output is correct
41 Correct 39 ms 6956 KB Output is correct
42 Correct 283 ms 6956 KB Output is correct
43 Correct 36 ms 6956 KB Output is correct
44 Correct 266 ms 6960 KB Output is correct
45 Correct 39 ms 6960 KB Output is correct
46 Correct 296 ms 6956 KB Output is correct
47 Correct 3 ms 6956 KB Output is correct
48 Correct 136 ms 6956 KB Output is correct
49 Correct 146 ms 6952 KB Output is correct
50 Correct 286 ms 6960 KB Output is correct
51 Correct 266 ms 6960 KB Output is correct
52 Correct 16 ms 8804 KB Output is correct
53 Correct 19 ms 8804 KB Output is correct
54 Correct 16 ms 8804 KB Output is correct
55 Correct 26 ms 8804 KB Output is correct
56 Correct 19 ms 8808 KB Output is correct
57 Correct 23 ms 8808 KB Output is correct
58 Correct 29 ms 8808 KB Output is correct
59 Correct 23 ms 8800 KB Output is correct
60 Correct 29 ms 8808 KB Output is correct
61 Correct 16 ms 8808 KB Output is correct
62 Correct 23 ms 8804 KB Output is correct
63 Correct 26 ms 8804 KB Output is correct
64 Correct 23 ms 8808 KB Output is correct
65 Correct 19 ms 8808 KB Output is correct
66 Correct 19 ms 8804 KB Output is correct
67 Correct 19 ms 8808 KB Output is correct
68 Correct 26 ms 8804 KB Output is correct
69 Correct 19 ms 8804 KB Output is correct
70 Correct 19 ms 8804 KB Output is correct
71 Correct 29 ms 8804 KB Output is correct
72 Correct 16 ms 8676 KB Output is correct
73 Correct 26 ms 8804 KB Output is correct
74 Correct 29 ms 8940 KB Output is correct
75 Correct 26 ms 8936 KB Output is correct
76 Correct 29 ms 8940 KB Output is correct
77 Correct 36 ms 8936 KB Output is correct
78 Incorrect 33 ms 8932 KB Output isn't correct
79 Halted 0 ms 0 KB -