Submission #1081975

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081975		Boas	Closing Time (IOI23_closing)	C++17	9 / 100	103 ms	10076 KiB

closing

#include "closing.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long
#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
typedef pair<int, int> ii;
typedef signed i32;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<i32> vi32;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

i32 max_score(i32 N, i32 X, i32 Y, int K, vi32 U, vi32 V, vi32 W)
{
    assert(N <= 20);
    vvii adj(N);
    loop(N - 1, i)
    {
        adj[U[i]].pb({V[i], W[i]});
        adj[V[i]].pb({U[i], W[i]});
    }
    vi xTime(N), yTime(N);
    auto dfs = [&](auto &&self, int i, int prev, vi &time) -> void
    {
        for (auto [j, w] : adj[i])
        {
            if (j == prev)
                continue;
            time[j] = time[i] + w;
            self(self, j, i, time);
        }
    };
    dfs(dfs, X, X, xTime);
    dfs(dfs, Y, Y, yTime);
    vi maxTime(N);
    loop(N, i) maxTime[i] = max(xTime[i], yTime[i]);
    int res = 0;
    for (unsigned mask = 0; mask < (1 << N); mask++)
    {
        int cur = 2 * __popcount(mask);
        int sum = 0;
        int first = -1;
        vb added(N);
        loop(N, i)
        {
            if ((1 << i) & mask)
            {
                added[i] = 1;
                first = i;
                sum += maxTime[i];
            }
        }
        int connected = 0;
        auto dfs2 = [&](auto &&self, int i, int prev) -> void
        {
            if (!added[i])
                return;
            if ((1 << i) & mask)
                connected++;
            for (auto [j, w] : adj[i])
            {
                if (j == prev)
                    continue;
                self(self, j, i);
            }
        };
        if (first != -1)
            dfs2(dfs2, first, first);
        if (connected != __popcount(mask))
            continue;
        if (sum > K)
        {
            continue;
        }
        vb vis(N);
        priority_queue<ii> q;
        q.push({0, X});
        q.push({0, Y});
        while (!q.empty())
        {
            auto [d, i] = q.top();
            q.pop();
            if (vis[i])
                continue;
            vis[i] = 1;
            if (!((1 << i) & mask))
            {
                cur++;
                sum -= d;
            }
            if (sum > K)
            {
                cur--;
                break;
            }
            added[i] = 1;
            for (auto [j, w] : adj[i])
            {
                if (vis[j])
                    continue;
                q.push({d - w, j});
            }
        }
        connected = 0;
        dfs2(dfs2, X, X);
        if (connected != __popcount(mask))
            continue;
        connected = 0;
        dfs2(dfs2, Y, Y);
        if (connected != __popcount(mask))
            continue;
        if (cur > res)
        {
            res = cur;
        }
    }
    return res;
}

Compilation message (stderr)

closing.cpp: In function 'i32 max_score(i32, i32, i32, long long int, vi32, vi32, vi32)':
closing.cpp:49:34: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   49 |     for (unsigned mask = 0; mask < (1 << N); mask++)
      |                             ~~~~~^~~~~~~~~~

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