Submission #910920

#	Time	Username	Problem	Language	Result	Execution time	Memory
910920		marvinthang	Closing Time (IOI23_closing)	C++17	100 / 100	258 ms	46952 KiB

closing

/*************************************
*    author: marvinthang             *
*    created: 18.01.2024 09:24:21    *
*************************************/
 
#include "closing.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif
 
template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b)  { return a < b ? a = b, true : false; }
 
// end of template
 
int max_score(int N, int X, int Y, long long K, vector <int> U, vector <int> V, vector <int> W) {
    vector <long long> dx(N), dy(N);
    vector <int> par(N);
    vector <vector <pair <int, int>>> adj(N);
    REP(i, N - 1) {
        adj[U[i]].emplace_back(W[i], V[i]);
        adj[V[i]].emplace_back(W[i], U[i]);
    } 
    function<void(int, int, vector <long long> &)> dfs = [&] (int u, int par, vector <long long> &dist) {
        for (auto [w, v]: adj[u]) if (v != par) {
            dist[v] = dist[u] + w;
            dfs(v, u, dist);
        }
    };
    par[X] = -1; dfs(X, -1, dx);
    par[Y] = -1; dfs(Y, -1, dy);
 
    vector <long long> values(ALL(dx));
    values.insert(values.end(), ALL(dy));
    sort(ALL(values));
    int res = 0;
    long long cur = K;
    for (long long c: values) {
        cur -= c;
        if (cur < 0) break;
        ++res;
    }
 
    vector <long long> List1 {0}, List2 {0};

    cur = K;
    int cnt = 0;
    REP(i, N) {
        long long a = dx[i], b = dy[i];
        if (a > b) swap(a, b);
        b -= a;
        if (dx[i] + dy[i] == dx[Y]) {
            cur -= a;
            ++cnt;
            List1.push_back(b);
        } else if (a <= b) {
            List1.push_back(a);
            List1.push_back(b);
        } else {
            List2.push_back(a + b);
        }
    } 
    if (cur < 0) return res;

    sort(ALL(List1)); sort(ALL(List2));
    partial_sum(ALL(List1), List1.begin());
    partial_sum(ALL(List2), List2.begin());

    int j = (int) List1.size() - 1;
    REP(i, List2.size()) {
        if (List2[i] > cur) break;
        while (j && List2[i] + List1[j] > cur) --j;
        maximize(res, cnt + i + i + j);
    }

    return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 12 / 12
• Subtask 4: 14 / 14
• Subtask 5: 9 / 9
• Subtask 6: 11 / 11
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 17 / 17