oj.uz

Submission #1079166

# Submission time Handle Problem Language Result Execution time Memory
1079166 2024-08-28T11:26:26 Z beaconmc Closing Time (IOI23_closing) C++17
8 / 100
 215 ms 55856 KB 
#include "closing.h"
#include <bits/stdc++.h>
    
using namespace std; 
 
 
typedef long long ll;
    
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 

ll n;
const ll maxn = 200005;
vector<vector<ll>> edges[maxn];
ll dist1[maxn];
ll dist2[maxn];
// ll dp[maxn][maxn*2];
vector<vector<ll>> dists;


void dfs(ll a, ll p, ll d, ll type){
    if (type==1) dist1[a] = d;
    else dist2[a] = d;

    for (auto&i : edges[a]){
        if (i[0] != p) dfs(i[0], a, d+i[1], type);
    }
}
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(i,0,N+1) edges[i].clear(), dist1[i] = 0, dist2[i] = 0;
    dists.clear();

    FOR(i,0,N-1){
        edges[U[i]].push_back({V[i], W[i]});
        edges[V[i]].push_back({U[i], W[i]});
    }
    dfs(X, -1, 0, 1);
    dfs(Y, -1, 0, 2);

    vector<ll> idkman;
    FOR(i,0,N){
        idkman.push_back(dist1[i]);
        idkman.push_back(dist2[i]);
    }
    sort(idkman.begin(), idkman.end());
    ll cur = 0;
    ll ans = 0;

    while (cur<idkman.size() && K-idkman[cur]>=0){
        K-= idkman[cur];
        ans++;
        cur++;
    }
    return ans;
    




    // FOR(i,0,N){
    //     vector<ll> temp = {};
    //     temp.push_back(min(dist1[i], dist2[i]));
    //     temp.push_back(max(dist1[i], dist2[i]));
    //     dists.push_back(temp);
    // }

    // FOR(i,0,N) FOR(j,0,2*N+1) dp[i][j] = 100000000000000000;
    
    // dp[0][0] = 0;
    // dp[0][1] = dists[0][0];
    // dp[0][2] = dists[0][1];


    // FOR(i,1,N){
    //     FOR(j,0,2*N+1){


    //         ll temp = 100000000000000000;
    //         if (j>=1) temp = min(temp, dp[i-1][j-1]+dists[i][0]);
    //         if (j>=2) temp = min(temp, dp[i-1][j-2]+dists[i][1]);
    //         temp = min(temp, dp[i-1][j]);
    //         dp[i][j] = temp;
    //     }
    // }
    // ll ans = 0;

    // FOR(i,0,N){
    //     FOR(j,0,2*N+1){
    //         if (dp[i][j] <=K){
    //             cout << i << " " << j << endl;
    //             cout << dp[i][j] << endl;

    //             ans = max(ans, j);
    //         }

    //     }
    // }
    // return ans;




}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:53:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     while (cur<idkman.size() && K-idkman[cur]>=0){
      |            ~~~^~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 47044 KB Output is correct
2 Correct 198 ms 55856 KB Output is correct
3 Correct 108 ms 11408 KB Output is correct

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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