oj.uz

답안 #927397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927397 2024-02-14T19:56:07 Z aykhn 봉쇄 시간 (IOI23_closing) C++17
8 / 100
 139 ms 40632 KB 
#include <bits/stdc++.h>
#include "closing.h"

using namespace std;

const int MXN = 2e5 + 5;

int n, x, y;
long long k;
vector<array<long long, 2>> adj[MXN];
long long d[2][MXN];

void dfs(int a, int p, int t)
{
    for (const array<long long, 2> &v : adj[a])
    {
        if (v[0] == p) continue;
        d[t][v[0]] = d[t][a] + v[1];
        dfs(v[0], a, t);
    }
}

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    n = N, x = X, y = Y, k = K;
    for (int i = 0; i < n; i++)
    {
        d[0][i] = d[1][i] = 0;
        adj[i].clear();
    }
    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);
    vector<long long> v;
    for (int i = 0; i < n; i++) v.push_back(min(d[1][i], d[0][i]));
    sort(v.begin(), v.end());
    int res = 0;
    for (int i = 0; i < n; i++)
    {
        k -= v[i];
        if (k < 0) break;
        res++;
    }
    return res;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 30692 KB Output is correct
2 Correct 139 ms 40632 KB Output is correct
3 Correct 61 ms 13140 KB Output is correct

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Incorrect 2 ms 8028 KB 1st lines differ - on the 1st token, expected: '30', found: '17'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8024 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -