제출 #1069757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069757		Faisal_Saqib	Closing Time (IOI23_closing)	C++17	8 / 100	109 ms	49152 KiB

closing

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define ppll pair<ll,pll>
#define vpl vector<pll>
const int N=5e5+10;
vpl ma[N];
ll paid[N],dist[N],n;
bool vis[N];
// ll dist_[2][N];
set<pll> update(set<pll>&pa)
{
    set<pll> pp;
    for(auto i:pa)
    {
        int u=i.second;
        ll c=i.first;
        if(u<n)
        {
            if(vis[u+n])
            {
                c-=min(c,dist[u+n]);
            }
        }
        else
        {
            if(vis[u-n])
            {
                c-=min(c,dist[u-n]);
            }
        }
        pp.insert({c,u});
    }
    return pp;
}
int max_score(int N, int x, int y, long long k, std::vector<int> U,std::vector<int> V, std::vector<int> W)
{
    n=N;
    for(int i=0;i<2*n;i++)
    {
        ma[i].clear();
        paid[i]=0;
        vis[i]=0;
        dist[i]=k+1;
    }
    int m=U.size();
    for(int i=0;i<m;i++)
    {
        ma[U[i]].push_back({W[i],V[i]});
        ma[U[i]+n].push_back({W[i],V[i]+n});
        ma[V[i]].push_back({W[i],U[i]});
        ma[V[i]+n].push_back({W[i],U[i]+n});
    }
    set<pll> pq;
    pq.insert({0,x});
    pq.insert({0,y+n});
    dist[x]=0;
    dist[y+n]=0;
    ll cur=0;
    while(pq.size()>0)
    {
        pq=update(pq);
        pll it=*pq.begin();
        pq.erase(begin(pq));
 
        int u=it.second;
        ll c=it.first;
 
        if(vis[u])continue;
        if((cur+c)>k)
        {
            continue;
        } 
        cur+=c;    
        vis[u]=1;
        for(auto [w,v]:ma[u])
        {
            ll cop=c+w;
            if(dist[v]>(cop))
            {
                dist[v]=cop;
                pq.insert({cop,v});
            }
        }
    }
    int total=0;
    for(int i=0;i<2*n;i++)
    {
        total+=vis[i];
    }
    return total;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 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