oj.uz

답안 #913889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
913889 2024-01-20T11:57:50 Z abcvuitunggio 봉쇄 시간 (IOI23_closing) C++17
8 / 100
 488 ms 51048 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];
multiset <pair <long long, int>> s,s2;
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++)
        s.insert({min(d[i][0],d[i][1]),i});
    cur=0;
    while (!s.empty()&&cur+(*s.begin()).first<=K){
        cur+=(*s.begin()).first;
        res++;
        s.erase(s.begin());
    }
    s.clear();
    cur=0;
    for (int i=0;i<N;i++){
        if (ch[i]){
            s.insert({abs(d[i][0]-d[i][1]),i});
            cur+=min(d[i][0],d[i][1]);
            cnt++;
        }
        else{
            s.insert({min(d[i][0],d[i][1]),i});
            s2.insert({max(d[i][0],d[i][1]),i});
        }
    }
    while (!s.empty()){
        long long x=0;
        int i=0,y=0;
        auto [c,u]=*s.begin();
        s.erase(s.begin());
        if (s2.empty())
            x=c,i=u,y=1;
        else{
            auto [c2,u2]=*s2.begin();
            s2.erase(s2.begin());
            if (s.empty()){
                s.insert({c,u});
                x=c2;
                i=u2;
                y=2;
            }
            else{
                if (c+(*s.begin()).first<c2){
                    s2.insert({c2,u2});
                    x=c;
                    i=u;
                    y=1;
                }
                else{
                    s.insert({c,u});
                    x=c2;
                    i=u2;
                    y=2;
                }
            }
        }
        if (cur+x>K)
            break;
        cnt++;
        if (y==1){
            cur+=x;
            if (!ch[i]){
                s.insert({abs(d[i][0]-d[i][1]),i});
                s2.erase(s2.find({max(d[i][0],d[i][1]),i}));
            }
        }
        if (y==2){
            cur+=min(d[i][0],d[i][1]);
            s.erase(s.find({min(d[i][0],d[i][1]),i}));
            s.insert({abs(d[i][0]-d[i][1]),i});
        }
        ch[i]=1;
    }
    s.clear();
    s2.clear();
    for (int i=0;i<N;i++)
        ke[i].clear();
    return max(res,(cur>K?0:cnt));
}

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 488 ms 50300 KB Output is correct
2 Correct 385 ms 51048 KB Output is correct
3 Correct 118 ms 12212 KB Output is correct

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7768 KB Output is correct
2 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
4 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
4 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Correct 3 ms 7768 KB Output is correct
3 Incorrect 2 ms 7772 KB 1st lines differ - on the 1st token, expected: '30', found: '29'
4 Halted 0 ms 0 KB -