oj.uz

Submission #1081886

# Submission time Handle Problem Language Result Execution time Memory
1081886 2024-08-30T12:32:46 Z LaMatematica14 Closing Time (IOI23_closing) C++17
0 / 100
 96 ms 28028 KB 
#include "closing.h"

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

int max_score(int N, int X, int Y, long long K,vector<int> U, vector<int> V, vector<int> W) {
    vector<vector<array<int, 2>>> adj(N);
    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]});
    }
    vector<long long> d;
    vector<long long> dx(N, 1e9); dx[X] = 0;
    priority_queue<pair<long long, int>> pq; pq.push({0, X});
    while (!pq.empty()) {
        int a = pq.top().second; pq.pop();
        for (auto x : adj[a]) {
            if (dx[x[0]] > dx[a]+x[1]) {
                dx[x[0]] = dx[a]+x[1];
                pq.push({-dx[x[0]], x[0]});
            }
        }
    }
    vector<long long> dy(N, 1e9); dy[Y] = 0;
    pq.push({0, Y});
    while (!pq.empty()) {
        int a = pq.top().second; pq.pop();
        for (auto x : adj[a]) {
            if (dy[x[0]] > dy[a]+x[1]) {
                dy[x[0]] = dy[a]+x[1];
                pq.push({-dy[x[0]], x[0]});
            }
        }
    }
    for (int i = 0; i < N; i++) {
        d.push_back(dx[i]); d.push_back(dy[i]);
    }
    sort(d.begin(), d.end());
    long long att = 0, k = 0;
    while (att+d[k] <= K) {
        att += d[k]; k++;
    }
    return k;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 28028 KB Output is correct
2 Correct 75 ms 27720 KB Output is correct
3 Runtime error 36 ms 8016 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -