oj.uz

Submission #913462

# Submission time Handle Problem Language Result Execution time Memory
913462 2024-01-20T08:02:22 Z abcvuitunggio Closing Time (IOI23_closing) C++17
8 / 100
 268 ms 38348 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
vector <pair <int, int>> ke[200001];
long long d[200001][2],cur;
int p[200001],ch[200001];
priority_queue <pair <long long, int>, vector <pair <long long, int>>, greater <pair <long long, int>>> q;
void dfs(int u, int i, int par=-1){
    for (auto [v,w]:ke[u])
        if (v!=par){
            d[v][i]=d[u][i]+w;
            p[v]=u;
            dfs(v,i,u);
        }
}
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){
    for (int i=0;i<N-1;i++){
        ke[U[i]].push_back({V[i],W[i]});
        ke[V[i]].push_back({U[i],W[i]});
    }
    memset(ch,0,sizeof(ch));
    d[X][0]=d[Y][1]=0;
    dfs(X,0);
    dfs(Y,1);
    for (;X!=Y;X=p[X])
        ch[X]=1;
    ch[Y]=1;
    int res=0,cnt=0;
    for (int i=0;i<N;i++)
        q.push({min(d[i][0],d[i][1]),i});
    cur=0;
    while (!q.empty()&&cur+q.top().first<=K){
        cur+=q.top().first;
        res++;
        q.pop();
    }
    while (!q.empty())
        q.pop();
    cur=0;
    for (int i=0;i<N;i++){
        if (ch[i]){
            q.push({abs(d[i][0]-d[i][1])*2,i});
            cur+=min(d[i][0],d[i][1]);
            cnt++;
        }
        else
            q.push({max(d[i][0],d[i][1]),i});
    }
    while (!q.empty()&&cur+q.top().first<=K){
        int u=q.top().second;
        cur+=q.top().first/(2-ch[u]);
        cnt+=2-ch[u];
        ch[u]=-1;
        q.pop();
    }
    while (!q.empty())
        q.pop();
    for (int i=0;i<N;i++)
        if (!ch[i])
            q.push({min(d[i][0],d[i][1]),1});
    while (!q.empty()&&cur+q.top().first<=K){
        cur+=q.top().first;
        cnt++;
        q.pop();
    }
    while (!q.empty())
        q.pop();
    for (int i=0;i<N;i++)
        ke[i].clear();
    return max(res,(cur>K?0:cnt));
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 33072 KB Output is correct
2 Correct 239 ms 38348 KB Output is correct
3 Correct 104 ms 10324 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '40'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '40'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '40'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -