oj.uz

답안 #842979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842979 2023-09-03T14:07:46 Z I_love_Hoang_Yen 봉쇄 시간 (IOI23_closing) C++17
9 / 100
 233 ms 142168 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using Graph = vector<vector<pair<int,ll>>>;
 
void dfs(int u, int fu, const Graph& g, vector<ll>& dists, vector<int>& trace) {
    for (auto [v, w] : g[u]) {
        if (v == fu) continue;
        assert(dists[v] < 0);
 
        dists[v] = dists[u] + w;
        trace[v] = u;
        dfs(v, u, g, dists, trace);
    }
}
 
pair<vector<ll>, vector<int>> get_dists(int u, const Graph& g) {
    int n = g.size();
    vector<ll> dists(n, -1);
    vector<int> trace(n, -1);
    dists[u] = 0;
 
    dfs(u, -1, g, dists, trace);
    return {dists, trace};
}
 
int no_common(ll k, const vector<ll>& dx, const vector<ll>& dy) {
    vector<ll> all;
    for (auto d : dx) all.push_back(d);
    for (auto d : dy) all.push_back(d);
    sort(all.begin(), all.end());
    int cnt = 0;
    for (auto d : all) {
        if (d <= k) {
            k -= d;
            ++cnt;
        } else break;
    }
    return cnt;
}

ll f[3011][6011];
void upMin(ll& f, ll val) {
    if (val < f) f = val;
}

// N <= 3000
int sub8(int n, int k,
        const vector<ll>& dx, const vector<ll>& dy,
        const vector<bool>& on_path) {
    int res = no_common(k, dx, dy);

    if (n <= 3000) {
        memset(f, 0x7f, sizeof f);
        f[0][0] = 0;
        for (int i = 0; i < n; ++i) {
            if (on_path[i]) {
                for (int j = 0; j <= 2*i; ++j) {
                    upMin(f[i+1][j+1], f[i][j] + min(dx[i], dy[i]));
                    upMin(f[i+1][j+2], f[i][j] + max(dx[i], dy[i]));
                }
            } else {
                for (int j = 0; j <= 2*i; ++j) {
                    f[i+1][j] = min(f[i+1][j], f[i][j]);
                    upMin(f[i+1][j+1], f[i][j] + min(dx[i], dy[i]));
                    upMin(f[i+1][j+2], f[i][j] + max(dx[i], dy[i]));
                }
            }
        }
        for (int j = 0; j <= 2*n; ++j) {
            if (f[n][j] <= k) res = max(res, j);
        }
    }
    return res;
}
 
int max_score(int n, int X, int Y, long long K,
              vector<int> U, vector<int> V, vector<int> W) {
    Graph g(n);
    assert(int(U.size()) == n-1);
    assert(int(V.size()) == n-1);
    assert(int(W.size()) == n-1);
    for (int i = 0; i < n - 1; i++) {
        int u = U[i];
        int v = V[i];
        int w = W[i];
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }
    if (X > Y) swap(X, Y);
 
    auto [distsX, traceX] = get_dists(X, g);
    auto [distsY, traceY] = get_dists(Y, g);
    vector<bool> on_path(n, false);
    int cur = Y;
    while (cur != X) {
        on_path[cur] = true;
        cur = traceX[cur];
    }
    on_path[X] = true;
    
    return sub8(n, K, distsX, distsY, on_path);
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 141912 KB Output is correct
2 Correct 16 ms 141916 KB Output is correct
3 Correct 16 ms 142112 KB Output is correct
4 Correct 17 ms 141912 KB Output is correct
5 Correct 16 ms 141916 KB Output is correct
6 Correct 17 ms 141916 KB Output is correct
7 Correct 16 ms 141912 KB Output is correct
8 Correct 16 ms 141916 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 142064 KB Output is correct

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 141912 KB Output is correct
2 Correct 16 ms 141916 KB Output is correct
3 Correct 16 ms 142112 KB Output is correct
4 Correct 17 ms 141912 KB Output is correct
5 Correct 16 ms 141916 KB Output is correct
6 Correct 17 ms 141916 KB Output is correct
7 Correct 16 ms 141912 KB Output is correct
8 Correct 16 ms 141916 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 142064 KB Output is correct
12 Correct 17 ms 141916 KB Output is correct
13 Correct 16 ms 141916 KB Output is correct
14 Correct 17 ms 141916 KB Output is correct
15 Correct 16 ms 141916 KB Output is correct
16 Correct 17 ms 141896 KB Output is correct
17 Correct 16 ms 141916 KB Output is correct
18 Correct 233 ms 142088 KB Output is correct
19 Incorrect 18 ms 142168 KB 1st lines differ - on the 1st token, expected: '771', found: '0'
20 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 141912 KB Output is correct
2 Correct 16 ms 141916 KB Output is correct
3 Correct 16 ms 142112 KB Output is correct
4 Correct 17 ms 141912 KB Output is correct
5 Correct 16 ms 141916 KB Output is correct
6 Correct 17 ms 141916 KB Output is correct
7 Correct 16 ms 141912 KB Output is correct
8 Correct 16 ms 141916 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 142064 KB Output is correct
12 Correct 17 ms 141916 KB Output is correct
13 Correct 16 ms 141916 KB Output is correct
14 Correct 17 ms 141916 KB Output is correct
15 Correct 16 ms 141916 KB Output is correct
16 Correct 17 ms 141896 KB Output is correct
17 Correct 16 ms 141916 KB Output is correct
18 Correct 233 ms 142088 KB Output is correct
19 Incorrect 18 ms 142168 KB 1st lines differ - on the 1st token, expected: '771', found: '0'
20 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct
2 Correct 16 ms 141912 KB Output is correct
3 Correct 16 ms 141916 KB Output is correct
4 Correct 16 ms 142112 KB Output is correct
5 Correct 17 ms 141912 KB Output is correct
6 Correct 16 ms 141916 KB Output is correct
7 Correct 17 ms 141912 KB Output is correct
8 Correct 16 ms 141916 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141912 KB Output is correct
11 Correct 17 ms 141916 KB Output is correct
12 Correct 16 ms 141984 KB Output is correct
13 Correct 16 ms 141916 KB Output is correct
14 Incorrect 16 ms 141912 KB 1st lines differ - on the 1st token, expected: '38', found: '0'
15 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct
2 Correct 16 ms 141912 KB Output is correct
3 Correct 16 ms 141916 KB Output is correct
4 Correct 16 ms 142112 KB Output is correct
5 Correct 17 ms 141912 KB Output is correct
6 Correct 16 ms 141916 KB Output is correct
7 Correct 17 ms 141916 KB Output is correct
8 Correct 16 ms 141912 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 141916 KB Output is correct
12 Correct 16 ms 142064 KB Output is correct
13 Correct 17 ms 141916 KB Output is correct
14 Correct 16 ms 141916 KB Output is correct
15 Correct 17 ms 141916 KB Output is correct
16 Correct 16 ms 141916 KB Output is correct
17 Correct 17 ms 141896 KB Output is correct
18 Correct 16 ms 141916 KB Output is correct
19 Correct 17 ms 141912 KB Output is correct
20 Correct 16 ms 141916 KB Output is correct
21 Correct 16 ms 141916 KB Output is correct
22 Correct 16 ms 141912 KB Output is correct
23 Correct 17 ms 141916 KB Output is correct
24 Correct 16 ms 141984 KB Output is correct
25 Correct 16 ms 141916 KB Output is correct
26 Incorrect 16 ms 141912 KB 1st lines differ - on the 1st token, expected: '38', found: '0'
27 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct
2 Correct 16 ms 141912 KB Output is correct
3 Correct 16 ms 141916 KB Output is correct
4 Correct 16 ms 142112 KB Output is correct
5 Correct 17 ms 141912 KB Output is correct
6 Correct 16 ms 141916 KB Output is correct
7 Correct 17 ms 141916 KB Output is correct
8 Correct 16 ms 141912 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 141916 KB Output is correct
12 Correct 16 ms 142064 KB Output is correct
13 Correct 17 ms 141916 KB Output is correct
14 Correct 16 ms 141916 KB Output is correct
15 Correct 17 ms 141916 KB Output is correct
16 Correct 16 ms 141916 KB Output is correct
17 Correct 17 ms 141896 KB Output is correct
18 Correct 16 ms 141916 KB Output is correct
19 Correct 233 ms 142088 KB Output is correct
20 Incorrect 18 ms 142168 KB 1st lines differ - on the 1st token, expected: '771', found: '0'
21 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct
2 Correct 16 ms 141912 KB Output is correct
3 Correct 16 ms 141916 KB Output is correct
4 Correct 16 ms 142112 KB Output is correct
5 Correct 17 ms 141912 KB Output is correct
6 Correct 16 ms 141916 KB Output is correct
7 Correct 17 ms 141916 KB Output is correct
8 Correct 16 ms 141912 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 141916 KB Output is correct
12 Correct 16 ms 142064 KB Output is correct
13 Correct 17 ms 141916 KB Output is correct
14 Correct 16 ms 141916 KB Output is correct
15 Correct 17 ms 141916 KB Output is correct
16 Correct 16 ms 141916 KB Output is correct
17 Correct 17 ms 141896 KB Output is correct
18 Correct 16 ms 141916 KB Output is correct
19 Correct 233 ms 142088 KB Output is correct
20 Incorrect 18 ms 142168 KB 1st lines differ - on the 1st token, expected: '771', found: '0'
21 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 141916 KB Output is correct
2 Correct 16 ms 141912 KB Output is correct
3 Correct 16 ms 141916 KB Output is correct
4 Correct 16 ms 142112 KB Output is correct
5 Correct 17 ms 141912 KB Output is correct
6 Correct 16 ms 141916 KB Output is correct
7 Correct 17 ms 141916 KB Output is correct
8 Correct 16 ms 141912 KB Output is correct
9 Correct 16 ms 141916 KB Output is correct
10 Correct 16 ms 141916 KB Output is correct
11 Correct 16 ms 141916 KB Output is correct
12 Correct 16 ms 142064 KB Output is correct
13 Correct 17 ms 141916 KB Output is correct
14 Correct 16 ms 141916 KB Output is correct
15 Correct 17 ms 141916 KB Output is correct
16 Correct 16 ms 141916 KB Output is correct
17 Correct 17 ms 141896 KB Output is correct
18 Correct 16 ms 141916 KB Output is correct
19 Correct 233 ms 142088 KB Output is correct
20 Incorrect 18 ms 142168 KB 1st lines differ - on the 1st token, expected: '771', found: '0'
21 Halted 0 ms 0 KB -