제출 #950856

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950856		Nexus	Two Currencies (JOI23_currencies)	C++17	10 / 100	93 ms	193108 KiB

currencies

#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=2e3+9,M=2e18+9,mod=1e9+7;

ll n,m,q,a[N],b[N],pa[N],dep[N],s,t,x,y,z;
vector<ll>v[N],ed[N][N],p;

void dfs(ll node,ll par)
{
    pa[node]=par;
    dep[node]=dep[par]+1;
    for(auto i:v[node])if(i!=par)dfs(i,node);
}



int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    cin>>n>>m>>q;
    for(ll i=1;i<n;++i)
    {
        cin>>a[i]>>b[i];
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
    }
    
    for(ll i=0;i<m;++i)
    {
        cin>>x>>y;
        ed[a[x]][b[x]].push_back(y);
        ed[b[x]][a[x]].push_back(y);
    }
    
    dep[0]=-1,pa[1]=0;
    dfs(1,0);
    while(q--)
    {
        p.clear();
        cin>>s>>t>>x>>y;
        if(dep[s]<dep[t])swap(s,t);
        while(dep[s]>dep[t])
        {
            for(auto i:ed[s][pa[s]])p.push_back(i);
            s=pa[s];
        }
        while(s!=t)
        {
            for(auto i:ed[s][pa[s]])p.push_back(i);
            s=pa[s];
            
            for(auto i:ed[t][pa[t]])p.push_back(i);
            t=pa[t];
        }
        
        sort(p.begin(),p.end());
        n=p.size();
        for(ll i=0;i<n;++i)
        if(y>=p[i])y-=p[i];
        else
        {
            x-=n-i;
            break;
        }
        
        cout<<(x>=0?x:-1)<<'\n';
    }
    
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 28
• Subtask 3: 0 / 30
• Subtask 4: 0 / 32