제출 #1078347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1078347		vjudge1	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	81 ms	24404 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);    cin.tie(0);
#define vi vector<int>
#define ll long long
#define ff first
#define ss second
using namespace std;
const int MAX=2e5+5;
vector<pair<int,int>> v[MAX];
ll maxi=0;
int D[MAX];
int R[MAX];
void dfs(int u,int p){
    for(auto it:v[u]){
        if(it.ff==p)   continue;
        D[it.ff]=D[u]+it.ss;
        dfs(it.ff,u);
    }

}

int max_score(int n,int x,int y, ll k,vi u,vi l, vi w){
    for(int i=0;i<n-1;i++){
        v[u[i]].push_back({l[i],w[i]});
        v[l[i]].push_back({u[i],w[i]});
    }
    maxi=k;
    D[x]=0;
    dfs(x,-1);
    for(int i=0;i<n;i++){
        R[i]=D[i];
    }
    D[y]=0;
    dfs(y,-1);
    for(int i=0;i<n;i++){
        R[i]=min(D[i],R[i]);
        ///cout<<R[i]<<" ";
    }
    sort(R,R+n);
    ll awa=0;
    int ans=0;
    for(int i=0;i<n;i++){
        if(awa+R[i]<=k){
            awa+=R[i];
            ans++;
        }
        else    break;
    }
    for(int i=0;i<n;i++){
        v[i].clear();
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17