oj.uz

답안 #490750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
490750 2021-11-29T03:32:48 Z NhatMinh0208 Tug of War (BOI15_tug) C++14
100 / 100
 747 ms 10988 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> sus;
int n,m,i,j,k,t,t1,u,v,a,b;
int l[60001],r[60001],s[60001];
int mk[60001];
bitset<600001> bs;
set<int> gt[60001];
void dfs(int x, int p, int c) {
	mk[x]=1;
	if (c==0) {
		u+=s[p];
	}
	else {
		v+=s[p];
	}
		for (auto g : gt[x]) if (g-p) {
			if (!mk[l[g]]) {
				dfs(l[g],g,c^1);
			}
			if (!mk[r[g]]) {
				dfs(r[g],g,c^1);
			}
		}
}
int main()
{
	fio;
	cin>>n>>m;
	for (i=1;i<=2*n;i++) {
		cin>>l[i]>>r[i]>>s[i];
		r[i]+=n;
		t+=s[i];
		gt[l[i]].insert(i);	gt[r[i]].insert(i);
	}
	sus.clear();
	bs[0]=1;
	for (i=1;i<=2*n;i++) if (gt[i].size()==1) {
		sus.push_back(i);
	}
	for (i=0;i<sus.size();i++) {
		u=sus[i];
		mk[u]=1;
		v=(*(gt[u].begin()));
		gt[l[v]].erase(v);
		gt[r[v]].erase(v);
		if (l[v]==u) {
			bs<<=s[v];
			if (gt[r[v]].size()==1) {
				sus.push_back(r[v]);
			}
		}
		else {
			if (gt[l[v]].size()==1) {
				sus.push_back(l[v]);
			}
		}
	}
	for (i=1;i<=2*n;i++) {
		if (gt[i].size()==2 || (gt[i].size()==0 && mk[i])); else {
			return cout<<"NO",0;
		}
	}
  	//cout<<"CLEARED\n";
	for (i=1;i<=2*n;i++) {
		if (!mk[i]) {
			u=0;
			v=0;
			a=(*(gt[i].begin()));
			dfs(i,a,0);
      //    cout<<u<<' '<<v<<endl;
			if (u>v) swap(u,v);
			bs<<=u;
			bs|=(bs<<(v-u));
		}
	}
	for (i=0;i<=t;i++) {
		if (bs[i] && abs(i-(t-i))<=m) {
			return cout<<"YES",0;
		}
	}
	cout<<"NO";
}

Compilation message

tug.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
tug.cpp: In function 'int main()':
tug.cpp:138:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |  for (i=0;i<sus.size();i++) {
      |           ~^~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3276 KB Output is correct
2 Correct 2 ms 3276 KB Output is correct
3 Correct 2 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 2 ms 3276 KB Output is correct
6 Correct 2 ms 3276 KB Output is correct
7 Correct 2 ms 3276 KB Output is correct
8 Correct 2 ms 3276 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 2 ms 3276 KB Output is correct
11 Correct 3 ms 3276 KB Output is correct
12 Correct 2 ms 3276 KB Output is correct
13 Correct 2 ms 3276 KB Output is correct
14 Correct 2 ms 3276 KB Output is correct
15 Correct 3 ms 3276 KB Output is correct
16 Correct 2 ms 3280 KB Output is correct
17 Correct 2 ms 3276 KB Output is correct
18 Correct 3 ms 3276 KB Output is correct
19 Correct 2 ms 3276 KB Output is correct
20 Correct 2 ms 3276 KB Output is correct
21 Correct 2 ms 3280 KB Output is correct
22 Correct 2 ms 3280 KB Output is correct
23 Correct 2 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 2 ms 3276 KB Output is correct
26 Correct 61 ms 3844 KB Output is correct
27 Correct 10 ms 3792 KB Output is correct
28 Correct 45 ms 3796 KB Output is correct
29 Correct 9 ms 3788 KB Output is correct
30 Correct 48 ms 3788 KB Output is correct
31 Correct 10 ms 3788 KB Output is correct
32 Correct 46 ms 3828 KB Output is correct
33 Correct 10 ms 3788 KB Output is correct
34 Correct 10 ms 3844 KB Output is correct
35 Correct 9 ms 3776 KB Output is correct
36 Correct 45 ms 3828 KB Output is correct
37 Correct 9 ms 3856 KB Output is correct
38 Correct 46 ms 3840 KB Output is correct
39 Correct 14 ms 3848 KB Output is correct
40 Correct 45 ms 3828 KB Output is correct
41 Correct 9 ms 3852 KB Output is correct
42 Correct 46 ms 3848 KB Output is correct
43 Correct 9 ms 3792 KB Output is correct
44 Correct 46 ms 3812 KB Output is correct
45 Correct 13 ms 3796 KB Output is correct
46 Correct 45 ms 3796 KB Output is correct
47 Correct 10 ms 3868 KB Output is correct
48 Correct 34 ms 3864 KB Output is correct
49 Correct 32 ms 3856 KB Output is correct
50 Correct 61 ms 3836 KB Output is correct
51 Correct 48 ms 3848 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 5744 KB Output is correct
2 Correct 47 ms 5796 KB Output is correct
3 Correct 146 ms 5756 KB Output is correct
4 Correct 54 ms 5784 KB Output is correct
5 Correct 155 ms 5764 KB Output is correct
6 Correct 44 ms 5828 KB Output is correct
7 Correct 176 ms 5876 KB Output is correct
8 Correct 53 ms 5780 KB Output is correct
9 Correct 153 ms 5752 KB Output is correct
10 Correct 44 ms 5868 KB Output is correct
11 Correct 165 ms 5764 KB Output is correct
12 Correct 48 ms 5760 KB Output is correct
13 Correct 149 ms 5708 KB Output is correct
14 Correct 155 ms 5748 KB Output is correct
15 Correct 45 ms 5780 KB Output is correct
16 Correct 152 ms 5740 KB Output is correct
17 Correct 46 ms 5828 KB Output is correct
18 Correct 166 ms 5752 KB Output is correct
19 Correct 53 ms 5872 KB Output is correct
20 Correct 156 ms 5956 KB Output is correct
21 Correct 43 ms 5832 KB Output is correct
22 Correct 120 ms 5872 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3276 KB Output is correct
2 Correct 2 ms 3276 KB Output is correct
3 Correct 2 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 2 ms 3276 KB Output is correct
6 Correct 2 ms 3276 KB Output is correct
7 Correct 2 ms 3276 KB Output is correct
8 Correct 2 ms 3276 KB Output is correct
9 Correct 2 ms 3276 KB Output is correct
10 Correct 2 ms 3276 KB Output is correct
11 Correct 3 ms 3276 KB Output is correct
12 Correct 2 ms 3276 KB Output is correct
13 Correct 2 ms 3276 KB Output is correct
14 Correct 2 ms 3276 KB Output is correct
15 Correct 3 ms 3276 KB Output is correct
16 Correct 2 ms 3280 KB Output is correct
17 Correct 2 ms 3276 KB Output is correct
18 Correct 3 ms 3276 KB Output is correct
19 Correct 2 ms 3276 KB Output is correct
20 Correct 2 ms 3276 KB Output is correct
21 Correct 2 ms 3280 KB Output is correct
22 Correct 2 ms 3280 KB Output is correct
23 Correct 2 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 2 ms 3276 KB Output is correct
26 Correct 61 ms 3844 KB Output is correct
27 Correct 10 ms 3792 KB Output is correct
28 Correct 45 ms 3796 KB Output is correct
29 Correct 9 ms 3788 KB Output is correct
30 Correct 48 ms 3788 KB Output is correct
31 Correct 10 ms 3788 KB Output is correct
32 Correct 46 ms 3828 KB Output is correct
33 Correct 10 ms 3788 KB Output is correct
34 Correct 10 ms 3844 KB Output is correct
35 Correct 9 ms 3776 KB Output is correct
36 Correct 45 ms 3828 KB Output is correct
37 Correct 9 ms 3856 KB Output is correct
38 Correct 46 ms 3840 KB Output is correct
39 Correct 14 ms 3848 KB Output is correct
40 Correct 45 ms 3828 KB Output is correct
41 Correct 9 ms 3852 KB Output is correct
42 Correct 46 ms 3848 KB Output is correct
43 Correct 9 ms 3792 KB Output is correct
44 Correct 46 ms 3812 KB Output is correct
45 Correct 13 ms 3796 KB Output is correct
46 Correct 45 ms 3796 KB Output is correct
47 Correct 10 ms 3868 KB Output is correct
48 Correct 34 ms 3864 KB Output is correct
49 Correct 32 ms 3856 KB Output is correct
50 Correct 61 ms 3836 KB Output is correct
51 Correct 48 ms 3848 KB Output is correct
52 Correct 156 ms 5744 KB Output is correct
53 Correct 47 ms 5796 KB Output is correct
54 Correct 146 ms 5756 KB Output is correct
55 Correct 54 ms 5784 KB Output is correct
56 Correct 155 ms 5764 KB Output is correct
57 Correct 44 ms 5828 KB Output is correct
58 Correct 176 ms 5876 KB Output is correct
59 Correct 53 ms 5780 KB Output is correct
60 Correct 153 ms 5752 KB Output is correct
61 Correct 44 ms 5868 KB Output is correct
62 Correct 165 ms 5764 KB Output is correct
63 Correct 48 ms 5760 KB Output is correct
64 Correct 149 ms 5708 KB Output is correct
65 Correct 155 ms 5748 KB Output is correct
66 Correct 45 ms 5780 KB Output is correct
67 Correct 152 ms 5740 KB Output is correct
68 Correct 46 ms 5828 KB Output is correct
69 Correct 166 ms 5752 KB Output is correct
70 Correct 53 ms 5872 KB Output is correct
71 Correct 156 ms 5956 KB Output is correct
72 Correct 43 ms 5832 KB Output is correct
73 Correct 120 ms 5872 KB Output is correct
74 Correct 676 ms 10832 KB Output is correct
75 Correct 75 ms 10728 KB Output is correct
76 Correct 703 ms 10896 KB Output is correct
77 Correct 66 ms 10692 KB Output is correct
78 Correct 700 ms 10664 KB Output is correct
79 Correct 696 ms 10948 KB Output is correct
80 Correct 102 ms 10664 KB Output is correct
81 Correct 93 ms 10692 KB Output is correct
82 Correct 671 ms 10696 KB Output is correct
83 Correct 747 ms 10600 KB Output is correct
84 Correct 80 ms 10724 KB Output is correct
85 Correct 657 ms 10624 KB Output is correct
86 Correct 63 ms 10732 KB Output is correct
87 Correct 676 ms 10708 KB Output is correct
88 Correct 68 ms 10724 KB Output is correct
89 Correct 695 ms 10840 KB Output is correct
90 Correct 73 ms 10700 KB Output is correct
91 Correct 678 ms 10708 KB Output is correct
92 Correct 64 ms 10732 KB Output is correct
93 Correct 700 ms 10716 KB Output is correct
94 Correct 144 ms 10896 KB Output is correct
95 Correct 471 ms 10968 KB Output is correct
96 Correct 518 ms 10884 KB Output is correct
97 Correct 708 ms 10692 KB Output is correct
98 Correct 728 ms 10988 KB Output is correct