Submission #1081863

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081863		Boas	Closing Time (IOI23_closing)	C++17	0 / 100	1057 ms	28776 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)
{
    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);
    int res = 0;
    int lxDis = 0;
    for (int lx = X; lx >= 0; lx--)
    {
        lxDis += xTime[lx];
        for (int rx = X; rx < N; rx++)
        {
            for (int ly = Y; ly >= 0; ly--)
            {
                for (int ry = Y; ry < N; ry++)
                {
                    int dis = lxDis;
                    for (int i = X; i < N; i++)
                    {
                        int t = 0;
                        if (lx <= i && i <= rx)
                        {
                            t = max(xTime[i], t);
                        }
                        if (ly <= i && i <= ry)
                        {
                            t = max(yTime[i], t);
                        }
                        dis += t;
                    }
                    if (dis <= K)
                    {
                        int cnt = (rx - lx + 1) + (ry - ly + 1);
                        res = max(res, cnt);
                    }
                }
            }
        }
    }
    return res;
}

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