oj.uz

답안 #847598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
847598 2023-09-10T03:41:35 Z math_rabbit_1028 봉쇄 시간 (IOI23_closing) C++17
35 / 100
 157 ms 157108 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

int n, x, y, ch[202020], ans;
ll k, need[202020], dis[202020];
vector< pair<int, ll> > adj[202020];

int L;
vector< pair<int, ll> > path;
void find_path(int v) {
    for (int i = 0; i < adj[v].size(); i++) {
        if (path.back().first == y) return;
        int u = adj[v][i].first; ll w = adj[v][i].second;
        if (ch[u] == 1) continue;
        ch[u] = 1;
        path.push_back({u, w});
        find_path(u);
        if (path.back().first != y) path.pop_back();
    }
}

pair<int, ll> in[3030][3030];
void inner() {
    for (int r = 0; r <= L; r++) {
        in[r][L].first = r + 2;
        in[r][L].second = 0;
        ll need[3030];
        for (int i = 0; i <= r; i++) need[i] = dis[i] - dis[0];
        for (int i = r + 1; i <= L; i++) need[i] = 0;
        for (int i = 0; i <= L; i++) in[r][L].second += need[i];
        for (int l = L - 1; l >= 0; l--) {
            in[r][l].first = in[r][l + 1].first + 1;
            in[r][l].second = in[r][l + 1].second + max(0LL, dis[L] - dis[l] - need[l]);
        }
    }
}

ll dp[404040], nxt[404040];
void update(ll a, ll b) {
    for (int i = 0; i <= 2*n; i++) {
        ll val = dp[i];
        if (i >= 1) val = min(val, dp[i - 1] + a);
        if (i >= 2) val = min(val, dp[i - 2] + b);
        nxt[i] = val;
    }
    for (int i = 0; i <= 2*n; i++) dp[i] = nxt[i];
}
void DFS(int v, ll a, ll b) {
    for (int i = 0; i < adj[v].size(); i++) {
        int u = adj[v][i].first; ll w = adj[v][i].second;
        if (ch[u] == 1) continue;
        ch[u] = 1;
        update(a + w, b + w);
        DFS(u, a + w, b + w);
    }
}
void outer() {
    for (int i = 0; i <= 2*n; i++) dp[i] = 2e18;
    dp[0] = 0;

    for (int i = 0; i <= L; i++) {
        ll a = min(dis[i] - dis[0], dis[L] - dis[i]);
        ll b = max(dis[i] - dis[0], dis[L] - dis[i]);
        DFS(path[i].first, a, b);
    }
}

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 (int i = 0; i < n; i++) adj[i].clear();
    path.clear();

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

    for (int i = 0; i < n; i++) ch[i] = 0;
    path.push_back({x, 0});
    ch[x] = 1;
    find_path(x);
    assert(path.back().first == y);
    L = path.size() - 1;

    for (int i = 1; i <= L; i++) dis[i] = dis[i - 1] + path[i].second;

    inner();
    for (int i = 0; i < n; i++) ch[i] = 0;
    for (int i = 0; i <= L; i++) ch[path[i].first] = 1;
    outer();

    for (int r = 0; r <= L; r++) {
        for (int l = L; l >= 0; l--) {
            //cout << r << ", " << l << " : " << in[r][l].first << " " << in[r][l].second << "\n";
            if (k - in[r][l].second < 0) continue;
            int val = in[r][l].first;
            int idx = upper_bound(dp, dp + 2*n + 1, k - in[r][l].second) - dp - 1;
            ans = max(ans, val + idx);
        }
    }

    return ans;
}

Compilation message

closing.cpp: In function 'void find_path(int)':
closing.cpp:14: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]
   14 |     for (int i = 0; i < adj[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
closing.cpp: In function 'void DFS(int, ll, ll)':
closing.cpp:52: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]
   52 |     for (int i = 0; i < adj[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 115 ms 64280 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14776 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14776 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 16732 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 3 ms 18780 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14856 KB Output is correct
21 Correct 6 ms 29020 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 8 ms 37212 KB Output is correct
24 Correct 6 ms 37212 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14776 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 16732 KB Output is correct
11 Correct 2 ms 16732 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 16732 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 3 ms 18780 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14856 KB Output is correct
21 Correct 6 ms 29020 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 8 ms 37212 KB Output is correct
24 Correct 6 ms 37212 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 29 ms 15356 KB Output is correct
27 Correct 25 ms 15196 KB Output is correct
28 Correct 157 ms 146640 KB Output is correct
29 Correct 86 ms 103392 KB Output is correct
30 Correct 24 ms 37796 KB Output is correct
31 Correct 94 ms 157108 KB Output is correct
32 Correct 89 ms 156884 KB Output is correct

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14776 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 2 ms 14936 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14836 KB Output is correct
24 Correct 2 ms 14732 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Incorrect 2 ms 14684 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
28 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14776 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14856 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 4 ms 24924 KB Output is correct
24 Correct 8 ms 37212 KB Output is correct
25 Correct 6 ms 37212 KB Output is correct
26 Correct 2 ms 14936 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 3 ms 14684 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14836 KB Output is correct
31 Correct 2 ms 14732 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 3 ms 14684 KB Output is correct
34 Incorrect 2 ms 14684 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
35 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14776 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14856 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 4 ms 24924 KB Output is correct
24 Correct 8 ms 37212 KB Output is correct
25 Correct 6 ms 37212 KB Output is correct
26 Correct 4 ms 16732 KB Output is correct
27 Correct 29 ms 15356 KB Output is correct
28 Correct 25 ms 15196 KB Output is correct
29 Correct 157 ms 146640 KB Output is correct
30 Correct 86 ms 103392 KB Output is correct
31 Correct 24 ms 37796 KB Output is correct
32 Correct 94 ms 157108 KB Output is correct
33 Correct 89 ms 156884 KB Output is correct
34 Correct 2 ms 14936 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 3 ms 14684 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 2 ms 14836 KB Output is correct
39 Correct 2 ms 14732 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 3 ms 14684 KB Output is correct
42 Incorrect 2 ms 14684 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
43 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14776 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 3 ms 16732 KB Output is correct
12 Correct 2 ms 16732 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14856 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 4 ms 24924 KB Output is correct
24 Correct 8 ms 37212 KB Output is correct
25 Correct 6 ms 37212 KB Output is correct
26 Correct 4 ms 16732 KB Output is correct
27 Correct 29 ms 15356 KB Output is correct
28 Correct 25 ms 15196 KB Output is correct
29 Correct 157 ms 146640 KB Output is correct
30 Correct 86 ms 103392 KB Output is correct
31 Correct 24 ms 37796 KB Output is correct
32 Correct 94 ms 157108 KB Output is correct
33 Correct 89 ms 156884 KB Output is correct
34 Correct 2 ms 14936 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 3 ms 14684 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 2 ms 14836 KB Output is correct
39 Correct 2 ms 14732 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 3 ms 14684 KB Output is correct
42 Incorrect 2 ms 14684 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
43 Halted 0 ms 0 KB -