oj.uz

Submission #962552

# Submission time Handle Problem Language Result Execution time Memory
962552 2024-04-13T19:25:53 Z tutis Closing Time (IOI23_closing) C++17
8 / 100
 218 ms 59276 KB 
#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;
    }
    return ret;
}

Compilation message

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]]) {
      |            ~~~~~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 44224 KB Output is correct
2 Correct 218 ms 59276 KB Output is correct
3 Correct 83 ms 5564 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '30', found: '24'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 352 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -