oj.uz

Submission #1046057

# Submission time Handle Problem Language Result Execution time Memory
1046057 2024-08-06T09:30:22 Z ezzzay Closing Time (IOI23_closing) C++17
8 / 100
 80 ms 35512 KB 
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
#include <vector>
const int MN=3e5;
vector<pair<int,ll>>v[MN];
ll distx[MN],disty[MN];
void dfsx(int a, int p){
    for(auto t:v[a]){
        if(p==t.ff)continue;
        distx[t.ff]=distx[a]+t.ss;
        dfsx(t.ff,a);
    }
}
void dfsy(int a, int p){
    for(auto t:v[a]){
        if(p==t.ff)continue;
        disty[t.ff]=disty[a]+t.ss;
        dfsy(t.ff,a);
    }
}
int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    for(int i=0;i<N;i++){
        disty[i]=0;
        distx[i]=0;
    }
    for(int i=0;i<N;i++){
        v[i].clear();
    }
    ll k=K;
    for(int i=0;i<N-1;i++){
        int a=U[i];
        int b=V[i];
        ll c=W[i];
        v[a].pb({b,c});
        v[b].pb({a,c});
    }
    dfsx(X,-1);
    dfsy(Y,-1);
    vector<ll>vx,vy;
    for(int i=0;i<N;i++){
        vx.pb(distx[i]);
        vy.pb(disty[i]);
    }
    sort(vx.begin(),vx.end());
    sort(vy.begin(),vy.end());
    for(int i=1;i<N;i++){
        vy[i]+=vy[i-1];
    }
    for(int i=1;i<N;i++){
        //vy[i]+=vy[i-1];
    }
    ll s=0;
    ll ans=0;
    for(ll i=0;i<N;i++){
        s+=vx[i];
        if(s>k)break;
        auto it=upper_bound(vy.begin(),vy.end(),k-s+1);
        it--;
        int g=it-vy.begin();
       
        ans=max(ans,i+g+2);
        ////cout<<vy[it];
      //  return 0;
        
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 32712 KB Output is correct
2 Correct 80 ms 35512 KB Output is correct
3 Correct 44 ms 12368 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Incorrect 2 ms 9820 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -