제출 #914203

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

closing

#include <bits/stdc++.h>
#include "closing.h"

using namespace std;
#define int long long
const int INF=1e9;
vector<vector<pair<int,int>>> edges;
vector<int> dstX;
vector<int> dstY;
map<pair<int,int>,int> mp;
int n;
int dp(int i, int res){
    if(res<0) return -INF;
    if(i>=n) return 0;
    if(mp.find({i,res})!=mp.end()) return mp[{i,res}];
    int next=dp(i+1, res);
    int cl1=dp(i+1, res-min(dstY[i],dstX[i]))+1;
    int cl2=dp(i+1, res-dstY[i]-dstX[i])+2;
    return mp[{i,res}]=max(max(cl1, cl2), next);
}
signed max_score(signed N, signed rootX, signed rootY, long long K, std::vector<signed> U, std::vector<signed> V, std::vector<signed> W){
    edges.clear();
    mp.clear();
    dstX.clear();
    edges.resize(N);
    dstX.resize(N);
    dstY.resize(N);
    n=N;
    for (int i = 0; i < N-1; i++)
    {
        edges[V[i]].push_back({U[i], W[i]});
        edges[U[i]].push_back({V[i], W[i]});
    }
    vector<bool> visited(N);
    queue<pair<int,int>> queue;
    queue.push({rootX,0});
    while(!queue.empty()){
        int x=queue.front().first,w=queue.front().second; queue.pop();
        if(visited[x]) continue;
        visited[x]=true;
        dstX[x]=w;
        for (auto u: edges[x]) queue.push({u.first, u.second+w});
    }
    visited.clear();
    visited.resize(N);
    queue.push({rootY,0});
    while(!queue.empty()){
        int x=queue.front().first,w=queue.front().second; queue.pop();
        if(visited[x]) continue;
        visited[x]=true;
        dstY[x]=w;
        for (auto u: edges[x]) queue.push({u.first, u.second+w});
    }
    return (int)dp(0,K);
}

• 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