Submission #840073

#	Time	Username	Problem	Language	Result	Execution time	Memory
840073		normankr07	Closing Time (IOI23_closing)	C++17	0 / 100	1075 ms	2097152 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

// CC : g++ -std=gnu++17 -O2 -Wall -pipe -static -o "closing" "grader.cpp" "closing.cpp"

// Subtask 1
const int MAXN = 1e6;
vector<pair<int, int>> adj[MAXN];
ll dist[MAXN];

void DFS_dist(int u, int par, int d)
{
    dist[u] = d;
    for (auto &[v, w] : adj[u])
    {
        if (v == par)
            continue;
        DFS_dist(v, u, d + w);
    }
}

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{

    for (int i = 0; i < N - 1; i++)
    {
        adj[i].clear();
        memset(dist, 0, sizeof(dist));
    }
    for (int i = 0; i < N; i++)
    {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }

    DFS_dist(X, X, 0);
    vector<ll> xdist(dist, dist + N);
    DFS_dist(Y, Y, 0);
    vector<ll> ydist(dist, dist + N);

    sort(xdist.begin(), xdist.end());
    sort(ydist.begin(), ydist.end());

    vector<ll> dist;
    merge(xdist.begin(), xdist.end(), ydist.begin(), ydist.end(), back_inserter(dist));

    int j = 0, ans = 0;
    ll cst = 0;
    for (; cst + dist[j] <= K && j < dist.size(); ans++, j++)
        cst += dist[j];
    return ans;
}

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:52:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for (; cst + dist[j] <= K && j < dist.size(); ans++, j++)
      |                                  ~~^~~~~~~~~~~~~

• 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