답안 #406324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406324	2021-05-17T11:28:13 Z	codebuster_10	Tug of War (BOI15_tug)	C++17	100 / 100	738 ms	37580 KB

#include <bits/stdc++.h>
 
using namespace std ;
 
#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
 
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue
 
#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
 
template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}
 
void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}
 
void err(bool flag){cout << (flag?"YES":"NO"); exit(0);}
 
const int MAX_N = 2 * 300000 + 1;
multiset<pr<int,int>> g[MAX_N];
vt<bool> vis(MAX_N,false);
bitset<MAX_N> is;
int tot = 0;
 
void dfs(int i) {
	vis[i] = true;
	if (!sz(g[i])) return;
	auto [nxt,cost] = *g[i].begin();
	tot += cost;
	if (!vis[nxt]) {
		g[nxt].erase(g[nxt].find({i, -cost}));
		g[i].clear();
		dfs(nxt);
	}
}
 
 
signed main(){
  setIO() ;
	int n,k; rd(n,k);
	f(id,0,2*n){
		int l,r,s; rd(l,r,s);
		--l,--r;
		g[l].insert({r+n,s});
		g[r+n].insert({l,-s});
	}
	// keep removing those with degree one.
	queue<int> q;
	f(i,0,2*n){
		if(sz(g[i]) == 1) q.push(i);
		else if(sz(g[i]) == 0) err(0);
	}
	
	while(sz(q)){
		int now = q.front(); q.pop();
		if(!sz(g[now])) err(0);
		auto [nxt,cost] = *g[now].begin();
		tot += cost;
		g[now].clear();
		g[nxt].erase(g[nxt].find({now,-cost}));
		if(sz(g[nxt]) == 1) q.push(nxt);
	}
	
	vt<int> W;
	if(tot) W.pb(abs(tot));
	
	
	f(i,0,2*n) if(!vis[i] && sz(g[i])){
		tot = 0;
		g[i].erase(g[i].begin());
		dfs(i);
		if(tot) W.pb(abs(tot));
	}
	
	int sum = accumulate(all(W),0);
	is[0] = true;
	for(auto i : W) is |= (is << i);
	f(i,0,MAX_N){
		if(abs(sum - 2*i) <= k && is[i]) err(1);
	}
	err(0);
	
}

Subtask #1
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	28748 KB	Output is correct
2	Correct	16 ms	28696 KB	Output is correct
3	Correct	16 ms	28784 KB	Output is correct
4	Correct	15 ms	28748 KB	Output is correct
5	Correct	17 ms	28748 KB	Output is correct
6	Correct	17 ms	28748 KB	Output is correct
7	Correct	16 ms	28772 KB	Output is correct
8	Correct	16 ms	28760 KB	Output is correct
9	Correct	16 ms	28756 KB	Output is correct
10	Correct	16 ms	28688 KB	Output is correct
11	Correct	16 ms	28748 KB	Output is correct
12	Correct	16 ms	28712 KB	Output is correct
13	Correct	16 ms	28748 KB	Output is correct
14	Correct	16 ms	28784 KB	Output is correct
15	Correct	16 ms	28704 KB	Output is correct
16	Correct	16 ms	28748 KB	Output is correct
17	Correct	16 ms	28748 KB	Output is correct
18	Correct	16 ms	28748 KB	Output is correct
19	Correct	18 ms	28748 KB	Output is correct
20	Correct	16 ms	28884 KB	Output is correct
21	Correct	16 ms	28636 KB	Output is correct
22	Correct	16 ms	28748 KB	Output is correct
23	Correct	17 ms	28748 KB	Output is correct
24	Correct	16 ms	28788 KB	Output is correct
25	Correct	16 ms	28748 KB	Output is correct

Subtask #2
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	28748 KB	Output is correct
2	Correct	16 ms	28696 KB	Output is correct
3	Correct	16 ms	28784 KB	Output is correct
4	Correct	15 ms	28748 KB	Output is correct
5	Correct	17 ms	28748 KB	Output is correct
6	Correct	17 ms	28748 KB	Output is correct
7	Correct	16 ms	28772 KB	Output is correct
8	Correct	16 ms	28760 KB	Output is correct
9	Correct	16 ms	28756 KB	Output is correct
10	Correct	16 ms	28688 KB	Output is correct
11	Correct	16 ms	28748 KB	Output is correct
12	Correct	16 ms	28712 KB	Output is correct
13	Correct	16 ms	28748 KB	Output is correct
14	Correct	16 ms	28784 KB	Output is correct
15	Correct	16 ms	28704 KB	Output is correct
16	Correct	16 ms	28748 KB	Output is correct
17	Correct	16 ms	28748 KB	Output is correct
18	Correct	16 ms	28748 KB	Output is correct
19	Correct	18 ms	28748 KB	Output is correct
20	Correct	16 ms	28884 KB	Output is correct
21	Correct	16 ms	28636 KB	Output is correct
22	Correct	16 ms	28748 KB	Output is correct
23	Correct	17 ms	28748 KB	Output is correct
24	Correct	16 ms	28788 KB	Output is correct
25	Correct	16 ms	28748 KB	Output is correct
26	Correct	59 ms	29260 KB	Output is correct
27	Correct	24 ms	29296 KB	Output is correct
28	Correct	61 ms	29256 KB	Output is correct
29	Correct	26 ms	29296 KB	Output is correct
30	Correct	60 ms	29260 KB	Output is correct
31	Correct	25 ms	29356 KB	Output is correct
32	Correct	60 ms	29248 KB	Output is correct
33	Correct	25 ms	29212 KB	Output is correct
34	Correct	20 ms	29260 KB	Output is correct
35	Correct	24 ms	29296 KB	Output is correct
36	Correct	61 ms	29308 KB	Output is correct
37	Correct	25 ms	29260 KB	Output is correct
38	Correct	61 ms	29316 KB	Output is correct
39	Correct	25 ms	29260 KB	Output is correct
40	Correct	60 ms	29300 KB	Output is correct
41	Correct	25 ms	29292 KB	Output is correct
42	Correct	64 ms	29288 KB	Output is correct
43	Correct	25 ms	29260 KB	Output is correct
44	Correct	59 ms	29380 KB	Output is correct
45	Correct	25 ms	29296 KB	Output is correct
46	Correct	59 ms	29260 KB	Output is correct
47	Correct	18 ms	29132 KB	Output is correct
48	Correct	42 ms	29248 KB	Output is correct
49	Correct	40 ms	29260 KB	Output is correct
50	Correct	62 ms	29308 KB	Output is correct
51	Correct	64 ms	29300 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	31200 KB	Output is correct
2	Correct	27 ms	31180 KB	Output is correct
3	Correct	27 ms	31168 KB	Output is correct
4	Correct	28 ms	31168 KB	Output is correct
5	Correct	29 ms	31120 KB	Output is correct
6	Correct	27 ms	31160 KB	Output is correct
7	Correct	28 ms	31180 KB	Output is correct
8	Correct	28 ms	31220 KB	Output is correct
9	Correct	28 ms	31192 KB	Output is correct
10	Correct	29 ms	31104 KB	Output is correct
11	Correct	29 ms	31192 KB	Output is correct
12	Correct	27 ms	31180 KB	Output is correct
13	Correct	27 ms	31124 KB	Output is correct
14	Correct	29 ms	31212 KB	Output is correct
15	Correct	28 ms	31220 KB	Output is correct
16	Correct	28 ms	31184 KB	Output is correct
17	Correct	28 ms	31172 KB	Output is correct
18	Correct	29 ms	31180 KB	Output is correct
19	Correct	27 ms	31180 KB	Output is correct
20	Correct	27 ms	31164 KB	Output is correct
21	Correct	27 ms	31220 KB	Output is correct
22	Correct	29 ms	31284 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	28748 KB	Output is correct
2	Correct	16 ms	28696 KB	Output is correct
3	Correct	16 ms	28784 KB	Output is correct
4	Correct	15 ms	28748 KB	Output is correct
5	Correct	17 ms	28748 KB	Output is correct
6	Correct	17 ms	28748 KB	Output is correct
7	Correct	16 ms	28772 KB	Output is correct
8	Correct	16 ms	28760 KB	Output is correct
9	Correct	16 ms	28756 KB	Output is correct
10	Correct	16 ms	28688 KB	Output is correct
11	Correct	16 ms	28748 KB	Output is correct
12	Correct	16 ms	28712 KB	Output is correct
13	Correct	16 ms	28748 KB	Output is correct
14	Correct	16 ms	28784 KB	Output is correct
15	Correct	16 ms	28704 KB	Output is correct
16	Correct	16 ms	28748 KB	Output is correct
17	Correct	16 ms	28748 KB	Output is correct
18	Correct	16 ms	28748 KB	Output is correct
19	Correct	18 ms	28748 KB	Output is correct
20	Correct	16 ms	28884 KB	Output is correct
21	Correct	16 ms	28636 KB	Output is correct
22	Correct	16 ms	28748 KB	Output is correct
23	Correct	17 ms	28748 KB	Output is correct
24	Correct	16 ms	28788 KB	Output is correct
25	Correct	16 ms	28748 KB	Output is correct
26	Correct	59 ms	29260 KB	Output is correct
27	Correct	24 ms	29296 KB	Output is correct
28	Correct	61 ms	29256 KB	Output is correct
29	Correct	26 ms	29296 KB	Output is correct
30	Correct	60 ms	29260 KB	Output is correct
31	Correct	25 ms	29356 KB	Output is correct
32	Correct	60 ms	29248 KB	Output is correct
33	Correct	25 ms	29212 KB	Output is correct
34	Correct	20 ms	29260 KB	Output is correct
35	Correct	24 ms	29296 KB	Output is correct
36	Correct	61 ms	29308 KB	Output is correct
37	Correct	25 ms	29260 KB	Output is correct
38	Correct	61 ms	29316 KB	Output is correct
39	Correct	25 ms	29260 KB	Output is correct
40	Correct	60 ms	29300 KB	Output is correct
41	Correct	25 ms	29292 KB	Output is correct
42	Correct	64 ms	29288 KB	Output is correct
43	Correct	25 ms	29260 KB	Output is correct
44	Correct	59 ms	29380 KB	Output is correct
45	Correct	25 ms	29296 KB	Output is correct
46	Correct	59 ms	29260 KB	Output is correct
47	Correct	18 ms	29132 KB	Output is correct
48	Correct	42 ms	29248 KB	Output is correct
49	Correct	40 ms	29260 KB	Output is correct
50	Correct	62 ms	29308 KB	Output is correct
51	Correct	64 ms	29300 KB	Output is correct
52	Correct	26 ms	31200 KB	Output is correct
53	Correct	27 ms	31180 KB	Output is correct
54	Correct	27 ms	31168 KB	Output is correct
55	Correct	28 ms	31168 KB	Output is correct
56	Correct	29 ms	31120 KB	Output is correct
57	Correct	27 ms	31160 KB	Output is correct
58	Correct	28 ms	31180 KB	Output is correct
59	Correct	28 ms	31220 KB	Output is correct
60	Correct	28 ms	31192 KB	Output is correct
61	Correct	29 ms	31104 KB	Output is correct
62	Correct	29 ms	31192 KB	Output is correct
63	Correct	27 ms	31180 KB	Output is correct
64	Correct	27 ms	31124 KB	Output is correct
65	Correct	29 ms	31212 KB	Output is correct
66	Correct	28 ms	31220 KB	Output is correct
67	Correct	28 ms	31184 KB	Output is correct
68	Correct	28 ms	31172 KB	Output is correct
69	Correct	29 ms	31180 KB	Output is correct
70	Correct	27 ms	31180 KB	Output is correct
71	Correct	27 ms	31164 KB	Output is correct
72	Correct	27 ms	31220 KB	Output is correct
73	Correct	29 ms	31284 KB	Output is correct
74	Correct	690 ms	36676 KB	Output is correct
75	Correct	98 ms	36260 KB	Output is correct
76	Correct	693 ms	36648 KB	Output is correct
77	Correct	90 ms	36292 KB	Output is correct
78	Correct	713 ms	36648 KB	Output is correct
79	Correct	713 ms	37472 KB	Output is correct
80	Correct	91 ms	37060 KB	Output is correct
81	Correct	90 ms	37076 KB	Output is correct
82	Correct	713 ms	37580 KB	Output is correct
83	Correct	694 ms	37440 KB	Output is correct
84	Correct	88 ms	37060 KB	Output is correct
85	Correct	734 ms	37468 KB	Output is correct
86	Correct	91 ms	37084 KB	Output is correct
87	Correct	696 ms	37460 KB	Output is correct
88	Correct	93 ms	37024 KB	Output is correct
89	Correct	701 ms	37468 KB	Output is correct
90	Correct	93 ms	36996 KB	Output is correct
91	Correct	693 ms	37564 KB	Output is correct
92	Correct	95 ms	37060 KB	Output is correct
93	Correct	700 ms	37464 KB	Output is correct
94	Correct	61 ms	36932 KB	Output is correct
95	Correct	419 ms	37372 KB	Output is correct
96	Correct	386 ms	37440 KB	Output is correct
97	Correct	731 ms	37492 KB	Output is correct
98	Correct	738 ms	37472 KB	Output is correct

답안 #406324

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