oj.uz

답안 #1073336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073336 2024-08-24T12:42:18 Z Unforgettablepl 봉쇄 시간 (IOI23_closing) C++17
35 / 100
 853 ms 2097152 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18+1;

int max_score(int N,int X,int Y,long long K,
              vector<int> U,vector<int> V,vector<int> W){
    vector<vector<pair<int,long long>>> adj(N);
    for(int i=0;i<N-1;i++) {
        adj[U[i]].emplace_back(V[i],W[i]);
        adj[V[i]].emplace_back(U[i],W[i]);
    }
    vector<long long> distX(N);
    vector<long long> distY(N);
    auto dijkastra = [&](int x) {
        priority_queue<pair<long long,int>> pq;
        pq.emplace(0,x);
        vector<bool> visited(N);
        while(!pq.empty()) {
            auto [dist,idx] = pq.top();pq.pop();dist=-dist;
            if(visited[idx])continue;
            visited[idx]=true;
            distX[idx]=dist;
            for(auto[v,c]:adj[idx])if(!visited[v])pq.emplace(-dist-c,v);
        }
    };
    dijkastra(Y);
    swap(distX,distY);
    dijkastra(X);
    vector cost1(N+1,0ll);
    vector cost2(N+1,0ll);
    for(int i=0;i<N;i++) {
        long long mini = min(distX[i],distY[i]);
        long long maxi = max(distX[i],distY[i]);
        cost1[i+1] = mini;
        cost2[i+1] = maxi;
    }
    int simple_ans = 0;
    {
        auto c = cost1;
        sort(c.begin(), c.end());
        long long sum = 0;
        for(int i=1;i<=N;i++) {
            sum+=c[i];
            if(sum<=K)simple_ans=i;
        }
    }
    vector onPath(N,false);
    {
        function<bool(int,int)> dfs = [&](int x,int p) {
            if(x==Y) {
                onPath[x]=true;
                return true;
            }
            for(auto[v,c]:adj[x])if(v!=p) {
                if(dfs(v,x)) {
                    onPath[x]=true;
                    return true;
                }
            }
            return false;
        };
        assert(dfs(X,-1));
    }
    vector DP(N+1,vector(2*N+1,INF));
    DP[0][0]=0;
    for(int i=1;i<=N;i++) {
        for(int j=0;j<=2*N;j++) {
            if(!onPath[i])DP[i][j]=min(DP[i][j],DP[i-1][j]);
            if(j>0)DP[i][j]=min(DP[i][j],DP[i-1][j-1]+cost1[i]);
            if(j>1)DP[i][j]=min(DP[i][j],DP[i-1][j-2]+cost2[i]);
        }
    }
    for(int j=2*N;j;j--)if(DP[N][j]<=K)return max(j,simple_ans);
    return simple_ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 3676 KB Output is correct
21 Correct 3 ms 3932 KB Output is correct
22 Correct 3 ms 4184 KB Output is correct
23 Correct 4 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 3 ms 3676 KB Output is correct
21 Correct 3 ms 3932 KB Output is correct
22 Correct 3 ms 4184 KB Output is correct
23 Correct 4 ms 4444 KB Output is correct
24 Correct 3 ms 4444 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 129 ms 141972 KB Output is correct
27 Correct 83 ms 122708 KB Output is correct
28 Correct 79 ms 124668 KB Output is correct
29 Correct 90 ms 134736 KB Output is correct
30 Correct 80 ms 121680 KB Output is correct
31 Correct 92 ms 142220 KB Output is correct
32 Correct 84 ms 142108 KB Output is correct

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '14', found: '12'
23 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 3 ms 3676 KB Output is correct
22 Correct 3 ms 3932 KB Output is correct
23 Correct 3 ms 4184 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '14', found: '12'
30 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 3 ms 3676 KB Output is correct
22 Correct 3 ms 3932 KB Output is correct
23 Correct 3 ms 4184 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 129 ms 141972 KB Output is correct
28 Correct 83 ms 122708 KB Output is correct
29 Correct 79 ms 124668 KB Output is correct
30 Correct 90 ms 134736 KB Output is correct
31 Correct 80 ms 121680 KB Output is correct
32 Correct 92 ms 142220 KB Output is correct
33 Correct 84 ms 142108 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '14', found: '12'
38 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 4444 KB Output is correct
21 Correct 3 ms 3676 KB Output is correct
22 Correct 3 ms 3932 KB Output is correct
23 Correct 3 ms 4184 KB Output is correct
24 Correct 4 ms 4444 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 129 ms 141972 KB Output is correct
28 Correct 83 ms 122708 KB Output is correct
29 Correct 79 ms 124668 KB Output is correct
30 Correct 90 ms 134736 KB Output is correct
31 Correct 80 ms 121680 KB Output is correct
32 Correct 92 ms 142220 KB Output is correct
33 Correct 84 ms 142108 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '14', found: '12'
38 Halted 0 ms 0 KB -