oj.uz

Submission #984602

# Submission time Handle Problem Language Result Execution time Memory
984602 2024-05-16T20:43:58 Z tvladm2009 Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 24916 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
const int N = 2e5 + 7;
 
vector<pair<int, int>> g[N];
int ans = 0;
 
vector<ll> find_dist(int n, int x) {
    vector<ll> dist(n, -1);
    queue<int> q;
    q.push(x);
    dist[x] = 0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (auto v : g[u]) {
            if (dist[v.first] == -1) {
                dist[v.first] = dist[u] + v.second;
                q.push(v.first);
            }
        }
    }
    return dist;
}
 
int max_score(int n, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    for (int i = 0; i < n; ++i) {
        g[i].clear();
    }
    ans = 0;
    for (int i = 0; i < n - 1; ++i) {
        g[U[i]].push_back(make_pair(V[i], W[i]));
        g[V[i]].push_back(make_pair(U[i], W[i]));
    }
    vector<ll> distX = find_dist(n, X);
    vector<ll> distY = find_dist(n, Y);
    vector<ll> one(n, 0), two(n, 0);
    for (int i = 0; i < n; ++i) {
        one[i] = min(distX[i], distY[i]);
        two[i] = max(distX[i], distY[i]);
    }
    { // we take only ones
        vector<ll> aux = one;
        sort(aux.begin(), aux.end());
        ll sum = 0;
        for (int i = 0; i < n; ++i) {
            if (sum + aux[i] <= K) {
                ans++;
                sum += aux[i];
            }
        }
    }
    // we take some twos => we take all twos on path X-Y
    vector<bool> counted(n, 0);
    ll d = distX[Y], between = 0;
    int cnt = 0;
    for (int i = 0; i < n; ++i) {
        if (distX[i] + distY[i] == d && i != X && i != Y) {
            between += two[i];
            cnt++;
            counted[i] = 1;
        }
    }
    ll sum_other_two = 0;
    vector<int> ord2(n);
    iota(ord2.begin(), ord2.end(), 0);
    sort(ord2.begin(), ord2.end(), [&](int x, int y) {
        return two[x] < two[y];
    });
    int ptr = 0;
 
    vector<int> ord1(n);
    iota(ord1.begin(), ord1.end(), 0);
    sort(ord1.begin(), ord1.end(), [&](int x, int y) {
        return one[x] < one[y];
    });
    auto get_sum_other_one = [&](int twos, int ones) {
        ll sum = 0;
        for (int i = 0; i < n; ++i) {
            if (counted[ord1[i]] == 0) {
                sum += one[ord1[i]];
                ones--;
                if (ones == 0) {
                    break;
                }
            }
        }
        return sum;
    };
 
    for (int twos = 0; twos + cnt <= n; ++twos) {
        if (twos != 0) {
            while (ptr < n && counted[ord2[ptr]] == 1) {
                ptr++;
            }
            sum_other_two += two[ord2[ptr]];
            counted[ord2[ptr]] = 1;
        }
 
        for (int ones = 0; ones + twos + cnt <= n; ones++) {
            if (sum_other_two + between + get_sum_other_one(twos, ones) <= K) {
                ans = max(ans, 2 * (twos + cnt) + ones);
            }
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 24916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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