Submission #980202

#	Time	Username	Problem	Language	Result	Execution time	Memory
980202		vjudge1	Closing Time (IOI23_closing)	C++17	8 / 100	81 ms	20308 KiB

closing

#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9, N_MAX=200000;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

int max_score(int n, int x, int y, ll k, vi u, vi v, vi w)
//int main()
{
    /*
    int n, x, y;
    ll k;
    cin>>n>>x>>y>>k;
    vi u(n+1), v(n+1), w(n+1);
    for(int i=0;i<n-1;i++)  cin>>u[i];
    for(int i=0;i<n-1;i++)  cin>>v[i];
    for(int i=0;i<n-1;i++)  cin>>w[i];
     */
    vvii al(n+1, vii());
    vll dist(n+1, INF), clos(n+1);
    for(int i=0;i<n-1;i++){
        al[u[i]].PB({v[i], w[i]});
        al[v[i]].PB({u[i], w[i]});
    }
    ll sum=0, tot=0, ans=0;
    priority_queue<pair<ll, int>> pq;
    dist[x]=dist[y]=clos[x]=clos[y]=0;
    pq.push({0, x});
    pq.push({0, y});
    while(!pq.empty()){
        int node=pq.top().S;
        ll dis=-pq.top().F;
        pq.pop();
        if(dis!=dist[node]) continue;
        sum+=clos[node];
        tot++;
        if(sum<=k)
            ans=tot;
        for(auto aux:al[node])
            if(dist[aux.F]>dis+aux.S){
                pq.push({-dis-aux.S, aux.F});
                dist[aux.F]=dis+aux.S;
                clos[aux.F]=clos[node]+aux.S;
            }
    }
    //cout<<ans<<endl;
    return (int)ans;
}

• 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