Submission #189097

#TimeUsernameProblemLanguageResultExecution timeMemory
189097MvCTug of War (BOI15_tug)C++11
0 / 100
22 ms632 KiB
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=1e5+50; const int mod=1e9+7; using namespace std; int n,k,l[50],r[50],s[50],ba,bb,sa,sb,i,j; int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); cin>>n>>k; for(i=0;i<2*n;i++)cin>>l[i]>>r[i]>>s[i]; for(i=0;i<(1<<(2*n));i++) { if(__builtin_popcount(i)!=n)continue; ba=bb=sa=sb=0; for(j=0;j<2*n;j++) { if(i&(1<<j))ba|=(1<<l[j]),sa+=s[j]; else bb|=(1<<(r[j]-n)),sb+=s[j]; } if(bb==(1<<n)-1 && bb==ba && abs(sa-sb)<=k)rc("YES"); } cout<<"NO"<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...