oj.uz

Submission #117140

# Submission time Handle Problem Language Result Execution time Memory
117140 2019-06-15T01:02:27 Z luciocf Tug of War (BOI15_tug) C++14
18 / 100
 580 ms 20472 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
 
using namespace std;
 
const int maxn = 4e3+10;
 
typedef pair<int, int> pii;
 
int n, k;
 
int sa, sb;
 
int pai[maxn], edge[maxn];
 
int firstCycle[maxn], lastCycle[maxn], pesoCycle[2][maxn], inCycle[maxn];
int comp[maxn], back[maxn];
 
bitset<20*maxn> dp[maxn];
 
bool mark[maxn];
 
vector<int> V;
 
vector<pii> grafo[maxn];

void dfs(int u, int p, int cc)
{
	comp[u] = cc;
 
	for (auto pp: grafo[u])
	{
		int v = pp.ff, w = pp.ss;
 
		if (comp[v])
		{
			if (v != p)
			{
				firstCycle[cc] = u, lastCycle[cc] = v;
				back[cc] = w;
			}
			continue;
		}
 
		pai[v] = u, edge[v] = w;
 
		dfs(v, u, cc);
	}
}
 
void markCycle(int cc)
{
	int u = firstCycle[cc], v = lastCycle[cc];
 
	int s0 = 0, s1 = back[cc];
	bool turn = 0;
 
	while (true)
	{
		inCycle[v] = true;
 
		if (!turn) s0 += edge[v];
		else s1 += edge[v];
 
		if (u == v) break;
 
		v = pai[v];
		turn = !turn;
	}
 
	pesoCycle[0][cc] = s0, pesoCycle[1][cc] = s1;
}
 
void dfs2(int u)
{
	mark[u] = true;
 
	for (auto pp: grafo[u])
	{
		int v = pp.ff;
		if (!mark[v])
			dfs2(v);
	}
 
	if (!inCycle[u])
	{
		if (u <= n) sa += edge[u];
		else sb += edge[u];
	}
}
 
int main(void)
{
	memset(firstCycle, -1, sizeof firstCycle);
 
	scanf("%d %d", &n, &k);

	int S = 0;
 
	for (int i = 1; i <= 2*n; i++)
	{
		int a, b, w;
		scanf("%d %d %d", &a, &b, &w);
 
		b += n;
		S += w;
 
		grafo[a].push_back({b, w});
		grafo[b].push_back({a, w});
	}
 
	int cc = 0;
	for (int i = 1; i <= 2*n; i++)
	{
		if (comp[i]) continue;
 
		dfs(i, 0, ++cc);
 
		if (firstCycle[cc] == -1)
		{
			printf("NO\n");
			return 0;
		}
	}
 
	for (int i = 1; i <= cc; i++)
	{
		markCycle(i);
		dfs2(firstCycle[i]);
	}
 
	// solve a
	dp[0][0] = 1;
	for (int i = 1; i <= cc; i++)
	{
		for (int j = (S-2*sa)/2; j >= 1; j--)
		{
			if (pesoCycle[0][i] <= j)
				dp[i][j] = dp[i][j]|dp[i-1][j-pesoCycle[0][i]];
			if (pesoCycle[1][i] <= j)
				dp[i][j] = dp[i][j]|dp[i-1][j-pesoCycle[1][i]];
		}
	}
 
	int mx = 0;
	for (int i = 1; i <= (S-2*sa)/2; i++)
		if (dp[cc][i])
			mx = max(mx, i);
 
	if (mx > 0 && S-2*(sa+mx) <= k)
	{
		printf("YES\n");
		return 0;
	}
 
	for (int i = 1; i <= cc; i++)
		dp[i].reset();
 
	// solve b
	dp[0][0] = 1;
	for (int i = 1; i <= cc; i++)
	{
		for (int j = (S-2*sb)/2; j >= 1; j--)
		{
			if (pesoCycle[0][i] <= j)
				dp[i][j] = dp[i][j]|dp[i-1][j-pesoCycle[0][i]];
			if (pesoCycle[1][i] <= j)
				dp[i][j] = dp[i][j]|dp[i-1][j-pesoCycle[1][i]];
		}
	}
 
	mx = 0;
	for (int i = 0; i <= (S-2*sb)/2; i++)
		if (dp[cc][i])
			mx = max(mx, i);
 
	if (mx > 0 && S-2*(sb+mx) <= k)
	{
		printf("YES\n");
		return 0;
	}
 
	printf("NO\n");
}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
tug.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &a, &b, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 276 ms 13808 KB Output is correct
27 Correct 79 ms 3320 KB Output is correct
28 Correct 275 ms 13816 KB Output is correct
29 Correct 78 ms 3192 KB Output is correct
30 Correct 551 ms 20344 KB Output is correct
31 Correct 78 ms 3448 KB Output is correct
32 Correct 282 ms 13916 KB Output is correct
33 Correct 77 ms 3192 KB Output is correct
34 Correct 22 ms 1536 KB Output is correct
35 Correct 77 ms 3420 KB Output is correct
36 Correct 275 ms 13820 KB Output is correct
37 Correct 76 ms 3192 KB Output is correct
38 Correct 580 ms 20472 KB Output is correct
39 Correct 156 ms 3192 KB Output is correct
40 Correct 297 ms 13820 KB Output is correct
41 Correct 78 ms 3192 KB Output is correct
42 Correct 560 ms 20472 KB Output is correct
43 Correct 78 ms 3320 KB Output is correct
44 Correct 283 ms 13816 KB Output is correct
45 Correct 79 ms 3192 KB Output is correct
46 Correct 284 ms 14200 KB Output is correct
47 Correct 5 ms 640 KB Output is correct
48 Correct 115 ms 6648 KB Output is correct
49 Incorrect 109 ms 6752 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 2688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 276 ms 13808 KB Output is correct
27 Correct 79 ms 3320 KB Output is correct
28 Correct 275 ms 13816 KB Output is correct
29 Correct 78 ms 3192 KB Output is correct
30 Correct 551 ms 20344 KB Output is correct
31 Correct 78 ms 3448 KB Output is correct
32 Correct 282 ms 13916 KB Output is correct
33 Correct 77 ms 3192 KB Output is correct
34 Correct 22 ms 1536 KB Output is correct
35 Correct 77 ms 3420 KB Output is correct
36 Correct 275 ms 13820 KB Output is correct
37 Correct 76 ms 3192 KB Output is correct
38 Correct 580 ms 20472 KB Output is correct
39 Correct 156 ms 3192 KB Output is correct
40 Correct 297 ms 13820 KB Output is correct
41 Correct 78 ms 3192 KB Output is correct
42 Correct 560 ms 20472 KB Output is correct
43 Correct 78 ms 3320 KB Output is correct
44 Correct 283 ms 13816 KB Output is correct
45 Correct 79 ms 3192 KB Output is correct
46 Correct 284 ms 14200 KB Output is correct
47 Correct 5 ms 640 KB Output is correct
48 Correct 115 ms 6648 KB Output is correct
49 Incorrect 109 ms 6752 KB Output isn't correct
50 Halted 0 ms 0 KB -