Submission #406130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
406130	2021-05-17T08:42:51 Z	codebuster_10	Tug of War (BOI15_tug)	C++17	41 / 100	293 ms	3052 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(){
	cout << "NO"; exit(0);
}
const int MX = 20 * 60000 + 1;
signed main(){
  setIO() ;
	int n,K; rd(n,K);
	vt<tuple<int,int,int>> g[2*n]; // {node,weight,id of edge}
	f(id,0,2*n){
		int l,r,s; rd(l,r,s);
		--l,--r;
		g[l].eb(r+n,s,id);
		g[r+n].eb(l,s,id);
	}
	vt<bool> vis(2*n,false), vis_node(2*n,false);
	vt<int> W;
	f(k,0,2*n) if(!vis_node[k]){
		int x = 0, edges = 0, nodes = 0;
		function<void(int)> dfs=[&](int i){
			++nodes;
			vis_node[i] = true;
			for(auto [j,w,id] : g[i]) if(!vis[id]){
				vis[id] = true;
				++edges;
				if(j<n) x += w;
				else		x -= w;
				if(!vis_node[j]) dfs(j);
			}
		};
		dfs(k);
		if(nodes != edges) err();
		W.pb(abs(x));
	}
	int sum = accumulate(all(W),0);
	bitset<MX> is;
	is[0] = true;
	for(auto i : W) is |= (is << i);
	f(i,0,MX){
		if(abs(sum - 2*i) <= K && is[i]){
			cout << "YES"; exit(0);
		}
	}
	err();
	
}

Subtask #1
18.0 / 18.0

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

Subtask #2
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	752 KB	Output is correct
2	Correct	2 ms	716 KB	Output is correct
3	Correct	3 ms	716 KB	Output is correct
4	Correct	1 ms	716 KB	Output is correct
5	Correct	3 ms	716 KB	Output is correct
6	Correct	3 ms	716 KB	Output is correct
7	Correct	1 ms	716 KB	Output is correct
8	Correct	1 ms	716 KB	Output is correct
9	Correct	1 ms	744 KB	Output is correct
10	Correct	3 ms	716 KB	Output is correct
11	Correct	1 ms	716 KB	Output is correct
12	Correct	2 ms	716 KB	Output is correct
13	Correct	1 ms	716 KB	Output is correct
14	Correct	1 ms	716 KB	Output is correct
15	Correct	2 ms	716 KB	Output is correct
16	Correct	3 ms	716 KB	Output is correct
17	Correct	2 ms	716 KB	Output is correct
18	Correct	2 ms	752 KB	Output is correct
19	Correct	2 ms	716 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	1 ms	716 KB	Output is correct
22	Correct	1 ms	716 KB	Output is correct
23	Correct	2 ms	716 KB	Output is correct
24	Correct	2 ms	716 KB	Output is correct
25	Correct	3 ms	716 KB	Output is correct
26	Correct	89 ms	1176 KB	Output is correct
27	Correct	16 ms	1100 KB	Output is correct
28	Correct	88 ms	1100 KB	Output is correct
29	Correct	16 ms	1192 KB	Output is correct
30	Correct	108 ms	1100 KB	Output is correct
31	Correct	16 ms	1100 KB	Output is correct
32	Correct	88 ms	1172 KB	Output is correct
33	Correct	16 ms	1200 KB	Output is correct
34	Correct	9 ms	1100 KB	Output is correct
35	Correct	16 ms	1192 KB	Output is correct
36	Correct	89 ms	1148 KB	Output is correct
37	Correct	16 ms	1196 KB	Output is correct
38	Correct	113 ms	1100 KB	Output is correct
39	Correct	19 ms	1140 KB	Output is correct
40	Correct	97 ms	1188 KB	Output is correct
41	Correct	16 ms	1100 KB	Output is correct
42	Correct	90 ms	1184 KB	Output is correct
43	Correct	15 ms	1100 KB	Output is correct
44	Correct	89 ms	1100 KB	Output is correct
45	Correct	16 ms	1192 KB	Output is correct
46	Correct	87 ms	1100 KB	Output is correct
47	Correct	3 ms	1100 KB	Output is correct
48	Correct	45 ms	1100 KB	Output is correct
49	Incorrect	45 ms	1100 KB	Output isn't correct
50	Halted	0 ms	0 KB	-

Subtask #3
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	270 ms	2884 KB	Output is correct
2	Correct	10 ms	2892 KB	Output is correct
3	Correct	266 ms	2944 KB	Output is correct
4	Correct	10 ms	2892 KB	Output is correct
5	Correct	293 ms	2932 KB	Output is correct
6	Correct	10 ms	2832 KB	Output is correct
7	Correct	270 ms	2932 KB	Output is correct
8	Correct	12 ms	2892 KB	Output is correct
9	Correct	278 ms	2932 KB	Output is correct
10	Correct	12 ms	2764 KB	Output is correct
11	Correct	273 ms	2940 KB	Output is correct
12	Correct	13 ms	2884 KB	Output is correct
13	Correct	269 ms	2892 KB	Output is correct
14	Correct	266 ms	2944 KB	Output is correct
15	Correct	13 ms	2892 KB	Output is correct
16	Correct	279 ms	2932 KB	Output is correct
17	Correct	10 ms	2860 KB	Output is correct
18	Correct	280 ms	3012 KB	Output is correct
19	Correct	13 ms	2892 KB	Output is correct
20	Correct	289 ms	3052 KB	Output is correct
21	Correct	11 ms	2892 KB	Output is correct
22	Correct	196 ms	2888 KB	Output is correct

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	752 KB	Output is correct
2	Correct	2 ms	716 KB	Output is correct
3	Correct	3 ms	716 KB	Output is correct
4	Correct	1 ms	716 KB	Output is correct
5	Correct	3 ms	716 KB	Output is correct
6	Correct	3 ms	716 KB	Output is correct
7	Correct	1 ms	716 KB	Output is correct
8	Correct	1 ms	716 KB	Output is correct
9	Correct	1 ms	744 KB	Output is correct
10	Correct	3 ms	716 KB	Output is correct
11	Correct	1 ms	716 KB	Output is correct
12	Correct	2 ms	716 KB	Output is correct
13	Correct	1 ms	716 KB	Output is correct
14	Correct	1 ms	716 KB	Output is correct
15	Correct	2 ms	716 KB	Output is correct
16	Correct	3 ms	716 KB	Output is correct
17	Correct	2 ms	716 KB	Output is correct
18	Correct	2 ms	752 KB	Output is correct
19	Correct	2 ms	716 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	1 ms	716 KB	Output is correct
22	Correct	1 ms	716 KB	Output is correct
23	Correct	2 ms	716 KB	Output is correct
24	Correct	2 ms	716 KB	Output is correct
25	Correct	3 ms	716 KB	Output is correct
26	Correct	89 ms	1176 KB	Output is correct
27	Correct	16 ms	1100 KB	Output is correct
28	Correct	88 ms	1100 KB	Output is correct
29	Correct	16 ms	1192 KB	Output is correct
30	Correct	108 ms	1100 KB	Output is correct
31	Correct	16 ms	1100 KB	Output is correct
32	Correct	88 ms	1172 KB	Output is correct
33	Correct	16 ms	1200 KB	Output is correct
34	Correct	9 ms	1100 KB	Output is correct
35	Correct	16 ms	1192 KB	Output is correct
36	Correct	89 ms	1148 KB	Output is correct
37	Correct	16 ms	1196 KB	Output is correct
38	Correct	113 ms	1100 KB	Output is correct
39	Correct	19 ms	1140 KB	Output is correct
40	Correct	97 ms	1188 KB	Output is correct
41	Correct	16 ms	1100 KB	Output is correct
42	Correct	90 ms	1184 KB	Output is correct
43	Correct	15 ms	1100 KB	Output is correct
44	Correct	89 ms	1100 KB	Output is correct
45	Correct	16 ms	1192 KB	Output is correct
46	Correct	87 ms	1100 KB	Output is correct
47	Correct	3 ms	1100 KB	Output is correct
48	Correct	45 ms	1100 KB	Output is correct
49	Incorrect	45 ms	1100 KB	Output isn't correct
50	Halted	0 ms	0 KB	-

Submission #406130

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 0 / 30.0

Subtask #3 23.0 / 23.0

Subtask #4 0 / 29.0

Subtask #1
18.0 / 18.0

Subtask #2
0 / 30.0

Subtask #3
23.0 / 23.0

Subtask #4
0 / 29.0