Submission #843880

#	Time	Username	Problem	Language	Result	Execution time	Memory
843880		nonono	Closing Time (IOI23_closing)	C++17	8 / 100	139 ms	43456 KiB

closing

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

using Graph = vector<vector<pair<int, long long>>> ;

void dfs(int u, int par, const Graph& g, vector<long long>& dist) {
    for(auto [v, w] : g[u]) {
        if(v == par) continue ;
        
        dist[v] = dist[u] + w;
        dfs(v, u, g, dist);
    }
}

int sub1(int N, long long K, vector<long long> dX, vector<long long> dY) {
    vector<long long> a;
    
    for(int i = 0; i < N; i ++) {
        a.push_back(dX[i]);
        a.push_back(dY[i]);
    }
    
    sort(a.begin(), a.end());
    
    long long sum = 0;
    int ans = 0;
    
    for(long long x : a) {
        if(sum + x > K) break ;
        sum += x;
        ans += 1;
    }
    
    return ans;
}

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W) {
    
    Graph g(N);
    vector<long long> dX(N, 0), dY(N, 0);
    
    for(int i = 0; i < N - 1; i ++) {
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }
    
    dfs(X, X, g, dX);
    dfs(Y, Y, g, dY);
    
    if(dX[Y] > 2 * K) return sub1(N, K, dX, dY);
}

// int main() {
//     int N, X, Y;
//     long long K;
//     cin >> N >> X >> Y >> K;
    
//     vector<int> U(N), V(N), W(N);
    
//     for(int i = 0; i < N - 1; i ++) {
//         cin >> U[i] >> V[i] >> W[i];
//     }
    
//     cout << max_score(N, X, Y, K, U, V, W) << "\n";
//     return 0;
// }

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:40:14: warning: control reaches end of non-void function [-Wreturn-type]
   40 |     Graph g(N);
      |              ^

• Subtask 0: 0 / 0
• Subtask 1: 8 / 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