oj.uz

Submission #1037307

# Submission time Handle Problem Language Result Execution time Memory
1037307 2024-07-28T13:26:00 Z binminh01 Tug of War (BOI15_tug) C++17
100 / 100
 315 ms 10000 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#endif
 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

multiset<pii> g[60001];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int n, k; cin >> n >> k;
    For(i,0,n<<1){
        int u, v, w; cin >> u >> v >> w; u--; v--; v+=n;
        g[u].emplace(v, w); g[v].emplace(u, w);
    }
    int d = 0;
    queue<int> q;
    For(i,0,n<<1){
        if (g[i].empty()) return no, 0;
        if (sz(g[i]) == 1) q.push(i);
    }
    while (sz(q)) {
        int u = q.front(); q.pop();
        if (g[u].empty()) return no, 0;
        auto [v, w] = *g[u].begin();
        if (u < n) d+=w;
        else d-=w;
        g[u].clear(); g[v].extract({u, w});
        if (g[v].empty()) return no, 0;
        if (sz(g[v]) == 1) q.push(v);
    }
    For(i,0,n<<1){
        if (sz(g[i]) && sz(g[i]) != 2) return no, 0;
    }
    vb c(n << 1);
    bitset<600001> b(1);
    int s = 0;
    For(i,0,n){
        if (sz(g[i]) && !c[i]) {
            int h = 0, u = i, e = 1;
            while (1) {
                if (c[u]) break;
                c[u] = 1;
                auto [v, w] = *g[u].begin();
                h+=e*w; e = -e;
                g[u].erase(g[u].begin());
                g[v].extract({u, w});
                u = v;
            }
            h = abs(h);
            s+=h;
            b|=b << h;
        }
    }
    FOR(i,0,600000){
        if (b[i] && abs(d + 2*i - s) <= k) return yes, 0;
    }
    no;
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 2 ms 3444 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 1 ms 3420 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3420 KB Output is correct
22 Correct 1 ms 3420 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 23 ms 3676 KB Output is correct
27 Correct 5 ms 3924 KB Output is correct
28 Correct 20 ms 3932 KB Output is correct
29 Correct 6 ms 3676 KB Output is correct
30 Correct 21 ms 4184 KB Output is correct
31 Correct 5 ms 3672 KB Output is correct
32 Correct 20 ms 3676 KB Output is correct
33 Correct 7 ms 3920 KB Output is correct
34 Correct 3 ms 3928 KB Output is correct
35 Correct 5 ms 3932 KB Output is correct
36 Correct 20 ms 3676 KB Output is correct
37 Correct 6 ms 3676 KB Output is correct
38 Correct 21 ms 3868 KB Output is correct
39 Correct 5 ms 3932 KB Output is correct
40 Correct 20 ms 3924 KB Output is correct
41 Correct 5 ms 3668 KB Output is correct
42 Correct 21 ms 3676 KB Output is correct
43 Correct 5 ms 3676 KB Output is correct
44 Correct 20 ms 3676 KB Output is correct
45 Correct 6 ms 3676 KB Output is correct
46 Correct 21 ms 3676 KB Output is correct
47 Correct 2 ms 3676 KB Output is correct
48 Correct 12 ms 3676 KB Output is correct
49 Correct 13 ms 3932 KB Output is correct
50 Correct 21 ms 3864 KB Output is correct
51 Correct 21 ms 3676 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 5468 KB Output is correct
2 Correct 6 ms 5468 KB Output is correct
3 Correct 72 ms 5724 KB Output is correct
4 Correct 7 ms 5468 KB Output is correct
5 Correct 61 ms 5468 KB Output is correct
6 Correct 6 ms 5468 KB Output is correct
7 Correct 66 ms 5724 KB Output is correct
8 Correct 7 ms 5468 KB Output is correct
9 Correct 63 ms 5408 KB Output is correct
10 Correct 8 ms 5468 KB Output is correct
11 Correct 62 ms 5468 KB Output is correct
12 Correct 8 ms 5512 KB Output is correct
13 Correct 61 ms 5468 KB Output is correct
14 Correct 63 ms 5592 KB Output is correct
15 Correct 7 ms 5468 KB Output is correct
16 Correct 61 ms 5592 KB Output is correct
17 Correct 6 ms 5468 KB Output is correct
18 Correct 61 ms 5576 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 61 ms 5488 KB Output is correct
21 Correct 7 ms 5484 KB Output is correct
22 Correct 34 ms 5468 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 2 ms 3444 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 1 ms 3420 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3420 KB Output is correct
22 Correct 1 ms 3420 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 23 ms 3676 KB Output is correct
27 Correct 5 ms 3924 KB Output is correct
28 Correct 20 ms 3932 KB Output is correct
29 Correct 6 ms 3676 KB Output is correct
30 Correct 21 ms 4184 KB Output is correct
31 Correct 5 ms 3672 KB Output is correct
32 Correct 20 ms 3676 KB Output is correct
33 Correct 7 ms 3920 KB Output is correct
34 Correct 3 ms 3928 KB Output is correct
35 Correct 5 ms 3932 KB Output is correct
36 Correct 20 ms 3676 KB Output is correct
37 Correct 6 ms 3676 KB Output is correct
38 Correct 21 ms 3868 KB Output is correct
39 Correct 5 ms 3932 KB Output is correct
40 Correct 20 ms 3924 KB Output is correct
41 Correct 5 ms 3668 KB Output is correct
42 Correct 21 ms 3676 KB Output is correct
43 Correct 5 ms 3676 KB Output is correct
44 Correct 20 ms 3676 KB Output is correct
45 Correct 6 ms 3676 KB Output is correct
46 Correct 21 ms 3676 KB Output is correct
47 Correct 2 ms 3676 KB Output is correct
48 Correct 12 ms 3676 KB Output is correct
49 Correct 13 ms 3932 KB Output is correct
50 Correct 21 ms 3864 KB Output is correct
51 Correct 21 ms 3676 KB Output is correct
52 Correct 60 ms 5468 KB Output is correct
53 Correct 6 ms 5468 KB Output is correct
54 Correct 72 ms 5724 KB Output is correct
55 Correct 7 ms 5468 KB Output is correct
56 Correct 61 ms 5468 KB Output is correct
57 Correct 6 ms 5468 KB Output is correct
58 Correct 66 ms 5724 KB Output is correct
59 Correct 7 ms 5468 KB Output is correct
60 Correct 63 ms 5408 KB Output is correct
61 Correct 8 ms 5468 KB Output is correct
62 Correct 62 ms 5468 KB Output is correct
63 Correct 8 ms 5512 KB Output is correct
64 Correct 61 ms 5468 KB Output is correct
65 Correct 63 ms 5592 KB Output is correct
66 Correct 7 ms 5468 KB Output is correct
67 Correct 61 ms 5592 KB Output is correct
68 Correct 6 ms 5468 KB Output is correct
69 Correct 61 ms 5576 KB Output is correct
70 Correct 6 ms 5468 KB Output is correct
71 Correct 61 ms 5488 KB Output is correct
72 Correct 7 ms 5484 KB Output is correct
73 Correct 34 ms 5468 KB Output is correct
74 Correct 292 ms 9936 KB Output is correct
75 Correct 31 ms 9820 KB Output is correct
76 Correct 290 ms 9820 KB Output is correct
77 Correct 30 ms 9816 KB Output is correct
78 Correct 288 ms 9820 KB Output is correct
79 Correct 277 ms 9820 KB Output is correct
80 Correct 31 ms 9820 KB Output is correct
81 Correct 34 ms 9820 KB Output is correct
82 Correct 292 ms 9932 KB Output is correct
83 Correct 299 ms 9936 KB Output is correct
84 Correct 30 ms 9820 KB Output is correct
85 Correct 304 ms 9820 KB Output is correct
86 Correct 31 ms 9820 KB Output is correct
87 Correct 300 ms 9928 KB Output is correct
88 Correct 31 ms 9820 KB Output is correct
89 Correct 296 ms 9820 KB Output is correct
90 Correct 30 ms 9820 KB Output is correct
91 Correct 294 ms 9820 KB Output is correct
92 Correct 30 ms 9788 KB Output is correct
93 Correct 291 ms 9940 KB Output is correct
94 Correct 19 ms 9820 KB Output is correct
95 Correct 165 ms 10000 KB Output is correct
96 Correct 157 ms 9820 KB Output is correct
97 Correct 284 ms 9820 KB Output is correct
98 Correct 315 ms 9932 KB Output is correct