Submission #1207472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207472		dksnfjkfnwkfw	Tug of War (BOI15_tug)	C++20	18 / 100	3087 ms	652 KiB

tug

#include <bits/stdc++.h>
using namespace std;

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 1e6 + 9;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, k;
int a[N];
int l[N], r[N], s[N];
int used[N];
void Read(){
    cin >> n >> k;
    n*=2;
    FOR(i, 1, n){
        cin >> l[i] >> r[i] >> s[i];
        r[i] += n/2;
    }
    FOR(mask, 0, MASK(n) - 1){
        int cnt = __builtin_popcount(mask);
        if(cnt!=n/2)continue;
        FOR(i, 1, n)used[i] = 0;
        int L = 0;
        int R = 0;
        FOR(i, 0, n - 1){
            if(BIT(mask, i)==1){
                L += s[i + 1];
                used[l[i + 1]]++;
            }
            else {
                R += s[i + 1];
                used[r[i + 1]]++;
            }
        }
        int ok = 1;
        FOR(i, 1, n){
            if(used[i] != 1)ok = 0;
        }
        if(abs(L - R) <= k&&ok ){
           /// FOR(i, 0, n - 1)cout << BIT(mask, i) << " ";
            cout << "YES";
           /// el;
            return;
        }
    }
    cout << "NO";
}



int main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

• Subtask 1: 18 / 18
• Subtask 2: 0 / 30
• Subtask 3: 0 / 23
• Subtask 4: 0 / 29