Submission #962952

#	Time	Username	Problem	Language	Result	Execution time	Memory
962952		tutis	Closing Time (IOI23_closing)	C++17	83 / 100	1054 ms	59396 KiB

closing

#include "closing.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int max_score(int N, int X, int Y, long long K,
              vector<int> U, vector<int> V, vector<int> W) {
    vector <pair<int, int>> adj[N];
    vector <vector<int>> adj1[2];
    adj1[0] = vector < vector < int >> (N);
    adj1[1] = vector < vector < int >> (N);
    for (int i = 0; i < N - 1; i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    vector <ll> D[2];
    D[0] = vector<ll>(N);
    D[1] = vector<ll>(N);
    int XY[2] = {X, Y};
    vector<int> x2y;
    for (int t: {0, 1}) {
        D[t][XY[t]] = 0;
        vector<int> P;
        function<void(int, int)> dfs = [&](int i, int p) -> void {
            if (p != -1) {
                adj1[t][p].push_back(i);
            }
            P.push_back(i);
            if (t == 0 && i == Y) {
                x2y = P;
            }
            for (auto j: adj[i]) {
                if (j.first == p) {
                    continue;
                }
                D[t][j.first] = D[t][i] + j.second;
                dfs(j.first, i);
            }
            P.pop_back();
        };
        dfs(XY[t], -1);
    }
    int ret = 0;
    vector <ll> cost[2];
    for (int t: {0, 1}) {
        ll sum = 0;
        priority_queue <pair<int, int>> Q;
        Q.push({0, XY[t]});
        while (!Q.empty()) {
            int i = Q.top().second;
            Q.pop();
            sum += D[t][i];
            cost[t].push_back(sum);
            if (sum > K) {
                break;
            }
            for (auto j: adj1[t][i]) {
                Q.push({-D[t][j], j});
            }
        }
    }
    for (int i = 0; i < cost[0].size(); i++) {
        for (int j = 0; j < cost[1].size(); j++) {
            if (cost[0][i] + cost[1][j] <= K) {
                ret = max(ret, i + 1 + j + 1);
            }
        }
    }

    int m = 0;
    while (m + 1 < x2y.size() && D[0][x2y[m + 1]] <= D[1][x2y[m + 1]]) {
        m++;
    }
    ll s0 = 0;
    ll s1 = 0;
    for (int i = 0; i <= m; i++) {
        s0 += D[0][x2y[i]];
        s0 = min(s0, K + 1);
    }
    for (int j = x2y.size() - 1; j > m; j--) {
        s1 += D[1][x2y[j]];
        s1 = min(s1, K + 1);
    }
    if (s0 + s1 > K) {
        return ret;
    }
    K -= s0 + s1;
    bool free[N];
    for (int i = 0; i < N; i++) {
        free[i] = false;
    }
    for (int i: x2y) {
        free[i] = true;
    }

    auto merge = [&](const vector <ll> &a, const vector <ll> &b) {
        vector <ll> r(a.size() + b.size() - 1, K + 1);
        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j < b.size(); j++) {
                r[i + j] = min(r[i + j], a[i] + b[j]);
            }
        }
        return r;
    };

    function < array < vector < ll > , 2 > (int, int, int) > fn = [&](int t, int i, int p) -> array<vector<ll>, 2> {
        vector <ll> ch[2] = {{0},
                             {0}};
        for (auto j: adj[i]) {
            if (j.first == p) {
                continue;
            }
            auto arrs = fn(t, j.first, i);
            ch[0] = merge(ch[0], arrs[0]);
            ch[1] = merge(ch[1], arrs[1]);
        }
        ll buyX = D[t][i];
        ll buyY = D[1 - t][i];
        int fr = 0;
        if (free[i]) {
            fr = 1;
            buyX = 0;
            buyY -= D[t][i];
        }
        array<vector<ll>, 2> ret;
        ret[0] = {0};
        ret[1] = {0};
        for (int i = 0; i < ch[0].size(); i++) {
            int ii = i + 1 - fr;
            while (ii >= ret[0].size()) {
                ret[0].push_back(K + 1);
            }
            while (ii >= ret[1].size()) {
                ret[1].push_back(K + 1);
            }
            ret[0][ii] = min(ret[0][ii], ch[0][i] + buyX);
            ret[1][ii] = min(ret[1][ii], ch[0][i] + buyX);
        }
        for (int i = 0; i < ch[1].size(); i++) {
            int ii = i + 2 - fr;
            while (ii >= ret[1].size()) {
                ret[1].push_back(K + 1);
            }
            ret[1][ii] = min(ret[1][ii], ch[1][i] + buyY);
        }
        return ret;
    };

    auto cost0 = fn(0, x2y[m], x2y[m + 1])[1];
    auto cost1 = fn(1, x2y[m + 1], x2y[m])[1];
    auto ans = merge(cost0, cost1);
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] <= K) {
            ret = max(ret, i + int(x2y.size()));
        }
    }

    return ret;
}

Compilation message (stderr)

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i = 0; i < cost[0].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~
closing.cpp:66:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for (int j = 0; j < cost[1].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~
closing.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     while (m + 1 < x2y.size() && D[0][x2y[m + 1]] <= D[1][x2y[m + 1]]) {
      |            ~~~~~~^~~~~~~~~~~~
closing.cpp: In lambda function:
closing.cpp:101:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int i = 0; i < a.size(); i++) {
      |                         ~~^~~~~~~~~~
closing.cpp:102:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
closing.cpp: In lambda function:
closing.cpp:131:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for (int i = 0; i < ch[0].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
closing.cpp:133:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |             while (ii >= ret[0].size()) {
      |                    ~~~^~~~~~~~~~~~~~~~
closing.cpp:136:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |             while (ii >= ret[1].size()) {
      |                    ~~~^~~~~~~~~~~~~~~~
closing.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |         for (int i = 0; i < ch[1].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
closing.cpp:144:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |             while (ii >= ret[1].size()) {
      |                    ~~~^~~~~~~~~~~~~~~~
closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:155:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     for (int i = 0; i < ans.size(); i++) {
      |                     ~~^~~~~~~~~~~~

• 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: 0 / 17