oj.uz

Submission #839997

# Submission time Handle Problem Language Result Execution time Memory
839997 2023-08-31T00:21:40 Z math_rabbit_1028 Closing Time (IOI23_closing) C++17
0 / 100
 74 ms 21756 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

ll n, x, y, ch[202020], ans;
ll k;
vector<pll> adj[202020];
priority_queue<pll> pq;

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N, x = X, y = Y, k = K;

    ans = 0;
    for (ll i = 0; i < n; i++) ch[i] = 0;
    for (ll i = 0; i < n; i++) adj[i].clear();
    if (!pq.empty()) pq.pop();

    for (ll i = 0; i < (ll)U.size(); i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }

    pq.push({-0, x});
    pq.push({-0, y});

    while (!pq.empty()) {
        ll v = pq.top().second; ll w = -pq.top().first;
        pq.pop();
        //cout << v << " " << w << "\n";
        if (k - w >= 0) {
            ans++;
            k -= w;
        }
        else break;
        
        ch[v] = 1;
        for (ll i = 0; i < (ll)adj[v].size(); i++) {
            if (ch[adj[v][i].first] == 1) continue;
            pq.push({-w-adj[v][i].second, adj[v][i].first});
        }
    }

    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 21688 KB Output is correct
2 Correct 72 ms 21756 KB Output is correct
3 Incorrect 45 ms 7612 KB 2nd lines differ - on the 1st token, expected: '38', found: '69'
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 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 2 ms 4948 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 2 ms 4948 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 2 ms 4948 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 2 ms 4948 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -