답안 #127079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127079	2019-07-08T21:18:56 Z	TadijaSebez	Tug of War (BOI15_tug)	C++11	71 / 100	3000 ms	5752 KB

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=60050;
vector<pair<int,int>> E[N];
bool was[N];
int n,k;
int sum[2],deg[N];
int main()
{
	int u,v,w;
	scanf("%i %i",&n,&k);
	for(int i=1;i<=2*n;i++)
	{
		scanf("%i %i %i",&u,&v,&w);
		v+=n;
		E[u].pb({v,w});
		E[v].pb({u,w});
		deg[u]++;
		deg[v]++;
	}
	queue<int> q;
	for(int i=1;i<=2*n;i++) if(deg[i]==1) q.push(i),was[i]=1;
	while(q.size())
	{
		int x=q.front();
		q.pop();
		int b=x>n;
		bool ok=0;
		for(auto e:E[x]) if(!was[e.first])
		{
			ok=1;
			v=e.first;
			w=e.second;
		}
		if(!ok || deg[v]==1) return 0*printf("NO\n");
        sum[b]+=w;
        deg[v]--;
		if(deg[v]==1) was[v]=1,q.push(v);
	}
	for(int i=1;i<=2*n;i++) if(!was[i] && deg[i]!=2) return 0*printf("NO\n");
	vector<int> cyc;
	for(int i=1;i<=2*n;i++) if(!was[i])
	{
		int all=0;
		int par=0;
		for(int x=i,t=1,y;;t=-t)
		{
			int w;
			was[x]=1;
			bool ok=0;
			for(auto e:E[x]) if(deg[e.first]==2 && e.first!=par)
			{
				y=e.first;
				w=e.second;
				ok=1;
			}
			if(!ok)
			{
				vector<int> ws;
				for(auto e:E[i]) if(deg[e.first]==2) ws.pb(e.second);
				all=ws[0]-ws[1];
				break;
			}
			all+=t*w;
			par=x;
			x=y;
			if(x==i) break;
		}
		cyc.pb(all);
	}
	/*set<int> dp;
	dp.insert(sum[1]-sum[0]);
	for(int x:cyc)
	{
		vector<int> ins;
		for(int y:dp)
		{
			ins.pb(y+x);
			ins.pb(y-x);
		}
		dp.clear();
		for(int y:ins) dp.insert(y);
	}
	int ans=1e9;
	for(int y:dp) ans=min(ans,abs(y));*/
	bitset<N*20> dp;
	dp[N*10+sum[1]-sum[0]]=1;
	for(int x:cyc)
	{
		x=abs(x);
		dp=(dp>>x)|(dp<<x);
	}
	int ans=1e9;
	for(int i=0;i<N*20;i++) if(dp[i])
	{
		int x=abs(N*10-i);
		ans=min(ans,x);
	}
	if(ans<=k) printf("YES\n");
	else printf("NO\n");
	return 0;
}

Compilation message

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

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	2424 KB	Output is correct
2	Correct	7 ms	2424 KB	Output is correct
3	Correct	7 ms	2424 KB	Output is correct
4	Correct	7 ms	2424 KB	Output is correct
5	Correct	7 ms	2424 KB	Output is correct
6	Correct	7 ms	2424 KB	Output is correct
7	Correct	7 ms	2424 KB	Output is correct
8	Correct	7 ms	2424 KB	Output is correct
9	Correct	7 ms	2424 KB	Output is correct
10	Correct	7 ms	2424 KB	Output is correct
11	Correct	7 ms	2424 KB	Output is correct
12	Correct	7 ms	2492 KB	Output is correct
13	Correct	7 ms	2424 KB	Output is correct
14	Correct	7 ms	2424 KB	Output is correct
15	Correct	7 ms	2424 KB	Output is correct
16	Correct	7 ms	2424 KB	Output is correct
17	Correct	7 ms	2424 KB	Output is correct
18	Correct	7 ms	2424 KB	Output is correct
19	Correct	7 ms	2424 KB	Output is correct
20	Correct	7 ms	2424 KB	Output is correct
21	Correct	3 ms	1784 KB	Output is correct
22	Correct	6 ms	2424 KB	Output is correct
23	Correct	6 ms	2428 KB	Output is correct
24	Correct	7 ms	2424 KB	Output is correct
25	Correct	7 ms	2424 KB	Output is correct
26	Correct	314 ms	2668 KB	Output is correct
27	Correct	49 ms	2680 KB	Output is correct
28	Correct	319 ms	2780 KB	Output is correct
29	Correct	50 ms	2812 KB	Output is correct
30	Correct	320 ms	2680 KB	Output is correct
31	Correct	49 ms	2552 KB	Output is correct
32	Correct	315 ms	2552 KB	Output is correct
33	Correct	49 ms	2808 KB	Output is correct
34	Correct	30 ms	2680 KB	Output is correct
35	Correct	49 ms	2680 KB	Output is correct
36	Correct	311 ms	2552 KB	Output is correct
37	Correct	50 ms	2680 KB	Output is correct
38	Correct	314 ms	2680 KB	Output is correct
39	Correct	49 ms	2680 KB	Output is correct
40	Correct	315 ms	2680 KB	Output is correct
41	Correct	50 ms	2680 KB	Output is correct
42	Correct	317 ms	2664 KB	Output is correct
43	Correct	52 ms	2552 KB	Output is correct
44	Correct	316 ms	2660 KB	Output is correct
45	Correct	52 ms	2680 KB	Output is correct
46	Correct	320 ms	2808 KB	Output is correct
47	Correct	5 ms	1912 KB	Output is correct
48	Correct	164 ms	2808 KB	Output is correct
49	Correct	163 ms	2680 KB	Output is correct
50	Correct	321 ms	2696 KB	Output is correct
51	Correct	321 ms	2780 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	963 ms	3340 KB	Output is correct
2	Correct	13 ms	2680 KB	Output is correct
3	Correct	983 ms	3420 KB	Output is correct
4	Correct	14 ms	2552 KB	Output is correct
5	Correct	976 ms	3320 KB	Output is correct
6	Correct	14 ms	2552 KB	Output is correct
7	Correct	983 ms	3320 KB	Output is correct
8	Correct	14 ms	2680 KB	Output is correct
9	Correct	964 ms	3420 KB	Output is correct
10	Correct	14 ms	2680 KB	Output is correct
11	Correct	973 ms	3448 KB	Output is correct
12	Correct	15 ms	2552 KB	Output is correct
13	Correct	950 ms	3324 KB	Output is correct
14	Correct	971 ms	3448 KB	Output is correct
15	Correct	13 ms	2552 KB	Output is correct
16	Correct	969 ms	3320 KB	Output is correct
17	Correct	13 ms	2552 KB	Output is correct
18	Correct	949 ms	3320 KB	Output is correct
19	Correct	14 ms	2680 KB	Output is correct
20	Correct	999 ms	3320 KB	Output is correct
21	Correct	14 ms	2552 KB	Output is correct
22	Correct	484 ms	3448 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	2424 KB	Output is correct
2	Correct	7 ms	2424 KB	Output is correct
3	Correct	7 ms	2424 KB	Output is correct
4	Correct	7 ms	2424 KB	Output is correct
5	Correct	7 ms	2424 KB	Output is correct
6	Correct	7 ms	2424 KB	Output is correct
7	Correct	7 ms	2424 KB	Output is correct
8	Correct	7 ms	2424 KB	Output is correct
9	Correct	7 ms	2424 KB	Output is correct
10	Correct	7 ms	2424 KB	Output is correct
11	Correct	7 ms	2424 KB	Output is correct
12	Correct	7 ms	2492 KB	Output is correct
13	Correct	7 ms	2424 KB	Output is correct
14	Correct	7 ms	2424 KB	Output is correct
15	Correct	7 ms	2424 KB	Output is correct
16	Correct	7 ms	2424 KB	Output is correct
17	Correct	7 ms	2424 KB	Output is correct
18	Correct	7 ms	2424 KB	Output is correct
19	Correct	7 ms	2424 KB	Output is correct
20	Correct	7 ms	2424 KB	Output is correct
21	Correct	3 ms	1784 KB	Output is correct
22	Correct	6 ms	2424 KB	Output is correct
23	Correct	6 ms	2428 KB	Output is correct
24	Correct	7 ms	2424 KB	Output is correct
25	Correct	7 ms	2424 KB	Output is correct
26	Correct	314 ms	2668 KB	Output is correct
27	Correct	49 ms	2680 KB	Output is correct
28	Correct	319 ms	2780 KB	Output is correct
29	Correct	50 ms	2812 KB	Output is correct
30	Correct	320 ms	2680 KB	Output is correct
31	Correct	49 ms	2552 KB	Output is correct
32	Correct	315 ms	2552 KB	Output is correct
33	Correct	49 ms	2808 KB	Output is correct
34	Correct	30 ms	2680 KB	Output is correct
35	Correct	49 ms	2680 KB	Output is correct
36	Correct	311 ms	2552 KB	Output is correct
37	Correct	50 ms	2680 KB	Output is correct
38	Correct	314 ms	2680 KB	Output is correct
39	Correct	49 ms	2680 KB	Output is correct
40	Correct	315 ms	2680 KB	Output is correct
41	Correct	50 ms	2680 KB	Output is correct
42	Correct	317 ms	2664 KB	Output is correct
43	Correct	52 ms	2552 KB	Output is correct
44	Correct	316 ms	2660 KB	Output is correct
45	Correct	52 ms	2680 KB	Output is correct
46	Correct	320 ms	2808 KB	Output is correct
47	Correct	5 ms	1912 KB	Output is correct
48	Correct	164 ms	2808 KB	Output is correct
49	Correct	163 ms	2680 KB	Output is correct
50	Correct	321 ms	2696 KB	Output is correct
51	Correct	321 ms	2780 KB	Output is correct
52	Correct	963 ms	3340 KB	Output is correct
53	Correct	13 ms	2680 KB	Output is correct
54	Correct	983 ms	3420 KB	Output is correct
55	Correct	14 ms	2552 KB	Output is correct
56	Correct	976 ms	3320 KB	Output is correct
57	Correct	14 ms	2552 KB	Output is correct
58	Correct	983 ms	3320 KB	Output is correct
59	Correct	14 ms	2680 KB	Output is correct
60	Correct	964 ms	3420 KB	Output is correct
61	Correct	14 ms	2680 KB	Output is correct
62	Correct	973 ms	3448 KB	Output is correct
63	Correct	15 ms	2552 KB	Output is correct
64	Correct	950 ms	3324 KB	Output is correct
65	Correct	971 ms	3448 KB	Output is correct
66	Correct	13 ms	2552 KB	Output is correct
67	Correct	969 ms	3320 KB	Output is correct
68	Correct	13 ms	2552 KB	Output is correct
69	Correct	949 ms	3320 KB	Output is correct
70	Correct	14 ms	2680 KB	Output is correct
71	Correct	999 ms	3320 KB	Output is correct
72	Correct	14 ms	2552 KB	Output is correct
73	Correct	484 ms	3448 KB	Output is correct
74	Execution timed out	3040 ms	5752 KB	Time limit exceeded
75	Halted	0 ms	0 KB	-

답안 #127079

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 30.0 / 30.0

Subtask #3 23.0 / 23.0

Subtask #4 0 / 29.0

Subtask #1
18.0 / 18.0

Subtask #2
30.0 / 30.0

Subtask #3
23.0 / 23.0

Subtask #4
0 / 29.0