Submission #1110950

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1110950	2024-11-11T05:48:35 Z	whatthemomooofun1729	Tug of War (BOI15_tug)	C++17	0 / 100	3000 ms	4760 KB

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
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 b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr long double EPS = (ld)1e-10, PI = 3.1415926535;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

const int MAXN = int(3e4) + 5;
const int MAXK = int(40 * MAXN) + 5;
int N, K, C = 0, sum = 0;
int cnt[MAXN];
vi vert, deg;
vc<pii> p;
vc<vi> S;
map<pii, int> mp;
map<int, vi> pmx, pmy;
vc<vi> adj;
vi vst, parent;
bitset<MAXK> dp[2]; // DP values: use the index trick
int cycle_start, cycle_end;
vi d;

bool dfs(int v, int par) { // passing vertex and its parent vertex
    vst[v] = true;
    for (int u : adj[v]) {
        if(u == par) continue; // skipping edge to parent vertex
        if (vst[u]) {
            cycle_end = v;
            cycle_start = u;
            return true;
        }
        parent[u] = v;
        if (dfs(u, parent[u]))
            return true;
    }
    return false;
}

int solve() {
    int D = sz(d);
    dp[0][d[0] + 20 * N] = dp[0][-d[0] + 20 * N] = true;
    for (int i = 1; i < D; ++i) {
        for (int j = 0; j <= 40 * N; ++j) {
            dp[1][j] = (j - d[i] >= 0 && dp[0][j - d[i]]) || (j + d[i] <= 40 * N && dp[0][j + d[i]]);
        }
        swap(dp[1], dp[0]);
    }
    for (int i = 0; i <= 40 * N; ++i) {
        int sba = i - 20 * N;
        if (dp[0][i] && abs(sba + sum) <= K) {
            return 1;
        }
    }
    return 0;
}

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> K;
    for (int i = 0; i < 2 * N; ++i) {
        int l, r, s;
        cin >> l >> r >> s;
        r += N;
        cnt[l]++, cnt[r]++;
        if (!mp.count({l, r})) {
            p.PB({l, r});
            mp[{l, r}] = C;
            S.PB({});
            S[C].PB(s);
            deg.PB(1);
            vert.PB(C++);
            pmx[l].PB(vert.back());
            pmy[r].PB(vert.back());
        } else {
            S[mp[{l, r}]].PB(s);
            deg[mp[{l, r}]]++;
            vert.PB(mp[{l, r}]);
        }
    }
    for (int i = 0; i < C; ++i) {
        if (deg[i] > 2) {
            cout << "NO";
            return 0;
        }
    }
    for (int i = 1; i <= 2 * N; ++i) {
        if (cnt[i] == 0 || cnt[i] > 3) {
            cout << "NO";
            return 0;
        }
    }
    adj.rsz(C), vst.rsz(C, 0), parent.rsz(C, -1);
    for (auto i = pmx.begin(); i != pmx.end(); i++) {
        assert(sz(i->ss) <= 2);
        if (sz(i->ss) == 1) continue;
        int a = (i->ss)[0], b = (i->ss)[1];
        if (deg[a] == 2 || deg[b] == 2) {
            if (deg[a] == 1) {
                d.PB(abs(S[b][0] - S[b][1]));
                sum -= S[a][0];
            } else {
                d.PB(abs(S[a][0] - S[a][1]));
                sum += S[b][0];
            }
        } else {
            adj[a].PB(b);
            adj[b].PB(a);
        }
    }
    for (auto i = pmy.begin(); i != pmy.end(); i++) {
        assert(sz(i->ss) <= 2);
        if (sz(i->ss) == 1) continue;
        int a = (i->ss)[0], b = (i->ss)[1];
        if (deg[a] == 2 || deg[b] == 2) {
            if (deg[a] == 1) {
                d.PB(abs(S[b][0] - S[b][1]));
                sum -= S[a][0];
            } else {
                d.PB(abs(S[a][0] - S[a][1]));
                sum += S[b][0];
            }
        } else {
            adj[a].PB(b);
            adj[b].PB(a);
        }
    }
    { // handling doubles
        for (int i = 0; i < C; ++i) {
            if (sz(S[i]) == 1) continue;
            d.PB(abs(S[i][0] - S[i][1]));
        }
    }
    { // handling cycles
        for (int i = 0; i < C; ++i) {
            if (!vst[i]) {
                if (dfs(i, parent[i])) {
                    int sumo = S[cycle_start][0], bit = 1;
                    for (int v = cycle_end; v != cycle_start; v = parent[v], bit ^= 1) {
                        sumo += ((bit & 1) ? -1 : 1) * S[v][0];
                    }
                    d.PB(abs(sumo));
                }
            }
        }
    }
    int s = solve();
    cout << ((s == 1) ? "YES" : "NO");
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

tug.cpp: In function 'void setIO(const string&)':
tug.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tug.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	848 KB	Output is correct
2	Correct	2 ms	848 KB	Output is correct
3	Correct	1 ms	848 KB	Output is correct
4	Correct	1 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	1 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	1 ms	848 KB	Output is correct
11	Correct	1 ms	848 KB	Output is correct
12	Correct	1 ms	848 KB	Output is correct
13	Correct	1 ms	848 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	864 KB	Output is correct
16	Correct	1 ms	848 KB	Output is correct
17	Correct	1 ms	848 KB	Output is correct
18	Correct	2 ms	1012 KB	Output is correct
19	Correct	1 ms	848 KB	Output is correct
20	Correct	1 ms	848 KB	Output is correct
21	Correct	1 ms	508 KB	Output is correct
22	Runtime error	1 ms	592 KB	Execution killed with signal 6
23	Halted	0 ms	0 KB	-

Subtask #2
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	848 KB	Output is correct
2	Correct	2 ms	848 KB	Output is correct
3	Correct	1 ms	848 KB	Output is correct
4	Correct	1 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	1 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	1 ms	848 KB	Output is correct
11	Correct	1 ms	848 KB	Output is correct
12	Correct	1 ms	848 KB	Output is correct
13	Correct	1 ms	848 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	864 KB	Output is correct
16	Correct	1 ms	848 KB	Output is correct
17	Correct	1 ms	848 KB	Output is correct
18	Correct	2 ms	1012 KB	Output is correct
19	Correct	1 ms	848 KB	Output is correct
20	Correct	1 ms	848 KB	Output is correct
21	Correct	1 ms	508 KB	Output is correct
22	Runtime error	1 ms	592 KB	Execution killed with signal 6
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3067 ms	4760 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	848 KB	Output is correct
2	Correct	2 ms	848 KB	Output is correct
3	Correct	1 ms	848 KB	Output is correct
4	Correct	1 ms	848 KB	Output is correct
5	Correct	2 ms	848 KB	Output is correct
6	Correct	1 ms	848 KB	Output is correct
7	Correct	2 ms	848 KB	Output is correct
8	Correct	2 ms	848 KB	Output is correct
9	Correct	2 ms	848 KB	Output is correct
10	Correct	1 ms	848 KB	Output is correct
11	Correct	1 ms	848 KB	Output is correct
12	Correct	1 ms	848 KB	Output is correct
13	Correct	1 ms	848 KB	Output is correct
14	Correct	1 ms	848 KB	Output is correct
15	Correct	1 ms	864 KB	Output is correct
16	Correct	1 ms	848 KB	Output is correct
17	Correct	1 ms	848 KB	Output is correct
18	Correct	2 ms	1012 KB	Output is correct
19	Correct	1 ms	848 KB	Output is correct
20	Correct	1 ms	848 KB	Output is correct
21	Correct	1 ms	508 KB	Output is correct
22	Runtime error	1 ms	592 KB	Execution killed with signal 6
23	Halted	0 ms	0 KB	-

Submission #1110950

Compilation message

Subtask #1 0 / 18.0

Subtask #2 0 / 30.0

Subtask #3 0 / 23.0

Subtask #4 0 / 29.0

Subtask #1
0 / 18.0

Subtask #2
0 / 30.0

Subtask #3
0 / 23.0

Subtask #4
0 / 29.0