oj.uz

Submission #1073316

# Submission time Handle Problem Language Result Execution time Memory
1073316 2024-08-24T12:17:08 Z Unforgettablepl Closing Time (IOI23_closing) C++17
0 / 100
 838 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;
    }
    vector DP(N+1,vector(2*N+1,INF));
    DP[0][0]=0;
    for(int i=1;i<=N;i++) {
        DP[i][0]=0;
        DP[i][1]=min(DP[i-1][1],cost1[i]);
        for(int j=2;j<=2*N;j++) {
            DP[i][j]=min({DP[i-1][j],DP[i-1][j-1]+cost1[i],DP[i-1][j-2]+cost2[i]});
        }
    }
    for(int j=2*N;j;j--)if(DP[N][j]<=K)return j;
    assert(false);
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 838 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 2nd lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -