oj.uz

Submission #927408

# Submission time Handle Problem Language Result Execution time Memory
927408 2024-02-14T20:12:15 Z aykhn Closing Time (IOI23_closing) C++17
8 / 100
 115 ms 37972 KB 
#include <bits/stdc++.h>
#include "closing.h"

using namespace std;

const int MXN = 2e5 + 5;

int n, x, y;
long long k;
vector<array<long long, 2>> adj[MXN];
long long d[2][MXN], p[2][MXN];

void dfs(int a, int p, int t)
{
    for (const array<long long, 2> &v : adj[a])
    {
        if (v[0] == p) continue;
        d[t][v[0]] = d[t][a] + v[1];
        dfs(v[0], a, t);
    }
}

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    n = N, x = X, y = Y, k = K;
    for (int i = 0; i < n; i++)
    {
        d[0][i] = d[1][i] = 0;
        adj[i].clear();
    }
    for (int i = 0; i < n - 1; i++)
    {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
    }
    dfs(x, x, 0);
    dfs(y, y, 1);
    int ans = 0;
    {
        vector<long long> v;
        for (int i = 0; i < n; i++) v.push_back(min(d[0][i], d[1][i]));
        sort(v.begin(), v.end());
        long long k1 = k;
        for (int i = 0; i < n; i++)
        {
            k1 -= v[i];
            if (k1 < 0) break;
            ans++;
        }
    }
    for (int j = 0; j < 2; j++)
    {
        for (int i = 0; i < N; i++)
        {
            p[j][i] = (i ? p[j][i - 1] : 0) + d[j][i];
        }
    }
    for (int i = X; i <= Y; i++)
    {
        long long k1 = k - (p[0][i] - (X ? p[0][X - 1] : 0LL)) - (p[1][Y] - (i ? p[1][i - 1] : 0LL));
        if (k1 < 0) continue;
        int res = Y - X + 2;
        vector<long long> v;
        long long s = 0;
        for (int j = i - 1; j >= 0; j--)
        {
            s += W[j];
            v.push_back(s);
        }
        s = 0;
        for (int j = i + 1; j < n; j++)
        {
            s += W[j - 1];
            v.push_back(s);
        }
        for (int j = 0; j < X; j++) v.push_back(d[0][j]);
        for (int j = Y + 1; j < n; j++) v.push_back(d[1][j]);
        sort(v.begin(), v.end());
        for (int i = 0; i < v.size(); i++)
        {
            k1 -= v[i];
            if (k1 < 0) break;
            res++;
        }
        ans = max(ans, res);
    }
    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:79:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         for (int i = 0; i < v.size(); i++)
      |                         ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 31880 KB Output is correct
2 Correct 115 ms 37972 KB Output is correct
3 Correct 58 ms 13692 KB Output is correct

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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