oj.uz

Submission #843857

# Submission time Handle Problem Language Result Execution time Memory
843857 2023-09-04T16:03:49 Z nonono Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 1992088 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN = 200000;

vector<vector<pair<int, int>>> adj(mxN);
long long d[2][mxN];

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

int sub1(int N, long long K) {
    vector<long long> a;
    
    for(int i = 0; i < N; i ++) {
        a.push_back(d[0][i]);
        a.push_back(d[1][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) {
    
    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]});
    }
    
    dfs(X, X, 0);
    dfs(Y, Y, 1);
    
    if(d[0][Y] > 2 * K) return sub1(N, K);
}

// 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

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:1: warning: control reaches end of non-void function [-Wreturn-type]
   52 | }
      | ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 34240 KB Output is correct
2 Correct 145 ms 40384 KB Output is correct
3 Execution timed out 1128 ms 1992088 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Incorrect 2 ms 5152 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 2 ms 4956 KB Output is correct
2 Incorrect 2 ms 5152 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 2 ms 4956 KB Output is correct
2 Incorrect 2 ms 5152 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 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1128 ms 1967568 KB Time limit exceeded
2 Halted 0 ms 0 KB -