oj.uz

답안 #842401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842401 2023-09-02T20:01:42 Z SHZhang 봉쇄 시간 (IOI23_closing) C++17
8 / 100
 635 ms 57424 KB 
#include "closing.h"

#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

#define ll long long

vector<pair<int, ll> > graph[200005];
ll distx[200005], disty[200005];

void dfs(int node, int parent, ll* dist)
{
    for (int i = 0; i < graph[node].size(); i++) {
        int nxt = graph[node][i].first;
        if (nxt == parent) continue;
        dist[nxt] = dist[node] + graph[node][i].second;
        dfs(nxt, node, dist);
    }
}

ll f[3005][6005];
const ll inf = 1000000000000000000LL;

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    for (int i = 0; i < N - 1; i++) {
        graph[U[i]].push_back(make_pair(V[i], (ll)W[i]));
        graph[V[i]].push_back(make_pair(U[i], (ll)W[i]));
    }
    dfs(X, -1, distx);
    dfs(Y, -1, disty);
    vector<ll> all_dists;
    for (int i = 0; i < N; i++) {
        all_dists.push_back(distx[i]);
        all_dists.push_back(disty[i]);
    }
    sort(all_dists.begin(), all_dists.end());
    int ans = 0;
    ll curtot = 0;
    for (int i = 0; i < 2*N; i++) {
        curtot += all_dists[i];
        if (curtot <= K) ans = i + 1;
    }
    f[0][0] = 0;
    if (N <= 3000) {
        for (int i = 0; i <= N; i++) {
            for (int j = 0; j <= 2 * N + 3; j++) f[i][j] = inf;
        }
        for (int i = 0; i < N; i++) {
            if (distx[i] + disty[i] == distx[Y]) {
                for (int j = 0; j <= 2 * i; j++) {
                    f[i+1][j+1] = min(f[i+1][j+1], f[i][j] + min(distx[i], disty[i]));
                    f[i+1][j+2] = min(f[i+1][j+2], f[i][j] + max(distx[i], disty[i]));
                }
            } else {
                for (int j = 0; j <= 2 * i; j++) {
                    f[i+1][j] = min(f[i+1][j], f[i][j]);
                    f[i+1][j+1] = min(f[i+1][j+1], f[i][j] + min(distx[i], disty[i]));
                    f[i+1][j+2] = min(f[i+1][j+2], f[i][j] + max(distx[i], disty[i]));
                }
            }
        }
        for (int i = 0; i <= 2 * N; i++) {
            if (f[N][i] <= K) {
                ans = max(ans, i);
            }
        }
    }
    for (int i = 0; i < N; i++) {
        graph[i].clear();
        distx[i] = disty[i] = 0;
    }
    return ans;
}

Compilation message

closing.cpp: In function 'void dfs(int, int, long long int*)':
closing.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i = 0; i < graph[node].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 6748 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 116 ms 33480 KB Output is correct
2 Correct 133 ms 39900 KB Output is correct
3 Correct 635 ms 57424 KB Output is correct

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 6748 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 1 ms 6748 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 1 ms 6748 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 1 ms 6748 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 1 ms 6748 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -