oj.uz

답안 #840169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840169 2023-08-31T07:41:03 Z socpite 봉쇄 시간 (IOI23_closing) C++17
43 / 100
 169 ms 47436 KB 
#include "closing.h"

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const long long INF = 1e18;

int onp[maxn];
long long depX[maxn], depY[maxn];
bool expanded[maxn];

vector<pair<int, int>> g[maxn];

void dfsX(int x, int p = -1)
{
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        depX[v.first] = depX[x] + v.second;
        dfsX(v.first, x);
    }
}

void dfsY(int x, int p = -1)
{
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        depY[v.first] = depY[x] + v.second;
        dfsY(v.first, x);
    }
}

long long solve1(int n, long long k)
{
    vector<long long> vec;
    vec.insert(vec.end(), depX, depX + n);
    vec.insert(vec.end(), depY, depY + n);
    sort(vec.begin(), vec.end());
    long long crr = 0;
    for (int i = 0; i < vec.size(); i++)
    {
        crr += vec[i];
        if (crr > k)
            return i;
    }
    return vec.size();
}

vector<int> path;

bool dfs_path(int x, int endp, int p = -1)
{
    if (x == endp)
        return (onp[x] = true);
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        onp[x] |= dfs_path(v.first, endp, x);
    }
    return onp[x];
}

vector<long long> vec1, vec2;
vector<long long> knapsack[maxn];
int mark[maxn];

bool chk(pair<int, int> a)
{
    return a.second < mark[a.first];
}

long long tval(pair<int, int> a)
{
    if (chk(a))
        return knapsack[a.first][a.second];
    else
        return knapsack[a.first][a.second] + knapsack[a.first][a.second + 1];
}

long long eval(pair<int, int> a)
{
    if (chk(a))
        return knapsack[a.first][a.second] * 2;
    else
        return knapsack[a.first][a.second] + knapsack[a.first][a.second + 1];
}

struct cmp
{
    bool operator()(const pair<int, int> a, const pair<int, int> b) const
    {
        return eval(a) > eval(b);
    }
};

void expand(int id, priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> &pq){
    assert(!expanded[id]);
    expanded[id] = 1;
    for (int i = mark[id]; i < knapsack[id].size(); i += 2)
        pq.push({id, i});
}

long long brute(priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> pq, pair<int, int> val, long long k)
{
    auto old_pq = pq;
    long long ans1 = 0, ans2 = 0, old_k = k;
    while (!pq.empty())
    {
        auto x = pq.top();
        pq.pop();
        if (k >= tval(x))
            k -= tval(x);
        else
        {
            if (k >= knapsack[x.first][x.second])
                ans1++;
            break;
        }
        ans1 += 2;
    }
    pq = old_pq;
    k = old_k;
    if (k >= tval(val))
    {
        k -= tval(val);
        ans2++;
        if(val.second+1 == mark[val.first])expand(val.first, pq);
        while (!pq.empty())
        {
            auto x = pq.top();
            pq.pop();
            if (k >= tval(x))
                k -= tval(x);
            else
            {
                if (k >= knapsack[x.first][x.second])
                    ans2++;
                break;
            }
            ans2 += 2;
        }
    }
    return max(ans1, ans2) ;
}

void dfs_gen(int x, int p, long long cnst)
{
    long long val;
    if (p == -1)
        val = 0;
    else
        val = min(depX[x], depY[x]);
    if (val > cnst)
        vec2.push_back(val);
    else
        vec1.push_back(val);
    for (auto v : g[x])
    {
        if (v.first == p || onp[v.first])
            continue;
        dfs_gen(v.first, x, cnst);
    }
}


long long solve2(int n, long long k, int x, int y)
{
    dfs_path(x, y);
    int len = 0;
    for (int i = 0; i < n; i++)
    {
        if (onp[i])
        {
            k -= min(depX[i], depY[i]);
            vec1.clear();
            vec2.clear();
            long long inc = abs(depX[i] - depY[i]);
            dfs_gen(i, -1, inc);
            sort(vec1.begin(), vec1.end());
            sort(vec2.begin(), vec2.end());
            knapsack[len] = vec1;
            for (auto v : vec1)
                knapsack[len].push_back(inc);
            mark[len] = knapsack[len].size();
            for (auto v : vec2)
            {
                knapsack[len].push_back(v);
                knapsack[len].push_back(inc);
            }
            expanded[len] = 0;
            len++;
            // cout << i << endl;
            // for(auto v: knapsack[len])cout << v << " ";
            // cout << endl;
        }
    }
    // cout << "left " << k << endl;
    if (k < 0)
        return 0;
    long long re = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> pq1;
    priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> pq2;
    for (int i = 0; i < len; i++)
    {
        for (int j = 0; j < mark[i]; j++)
            pq1.push({i, j});
    }
    while (!pq1.empty() || !pq2.empty())
    {
        if (pq1.empty())
        {
            auto x = pq2.top();
            pq2.pop();
            if (k >= tval(x))
                k -= tval(x);
            else
            {
                if (k >= knapsack[x.first][x.second])
                {
                    re++;
                }
                break;
            }
            re += 2;
        }
        else if (pq2.empty())
        {
            auto x = pq1.top();
            pq1.pop();
            if (k >= tval(x))
            {
                k -= tval(x);
                if (x.second + 1 == mark[x.first])
                {
                    expand(x.first, pq2);
                }
            }
            else
                break;
            re++;
        }
        else
        {
            auto pval = pq2.top();
            pq2.pop();
            auto val1 = pq1.top();
            pq1.pop();
            if (pq1.empty())
            {
                pq2.push(pval);
                return re + brute(pq2, val1, k);
            }
            else
            {
                auto val2 = pq1.top();
                pq1.pop();
                if (tval(pval) < tval(val1) + tval(val2))
                {
                    if (k >= tval(pval))
                    {
                        pq1.push(val1);
                        pq1.push(val2);
                        k -= tval(pval);
                        re += 2;
                    }
                    else
                    {
                        pq2.push(pval);
                        return re + brute(pq2, val1, k);
                    }
                }
                else
                {
                    if (k >= tval(val1) + tval(val2))
                    {
                        if (val1.second + 1 == mark[val1.first])
                        {
                            expand(val1.first, pq2);
                        }
                        if (val2.second + 1 == mark[val2.first])
                        {
                            expand(val2.first, pq2);
                        }
                        pq2.push(pval);
                        k -= tval(val1);
                        k -= tval(val2);
                        re += 2;
                    }
                    else
                    {
                        pq2.push(pval);
                        return re + brute(pq2, val1, k);
                    }
                }
            }
        }
    }

    return re;
}

void reset(int n)
{
    for (int i = 0; i < n; i++)
    {
        g[i].clear();
        onp[i] = 0;
    }
    path.clear();
}

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    reset(N);
    for (int i = 0; i < N - 1; i++)
    {
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }
    depX[X] = 0;
    depY[Y] = 0;
    dfsX(X);
    dfsY(Y);
    long long ans = max(solve1(N, K), solve2(N, K, X, Y));
    return ans;
}

Compilation message

closing.cpp: In function 'long long int solve1(int, long long int)':
closing.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i = 0; i < vec.size(); i++)
      |                     ~~^~~~~~~~~~~~
closing.cpp: In function 'void expand(int, std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, cmp>&)':
closing.cpp:103:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for (int i = mark[id]; i < knapsack[id].size(); i += 2)
      |                            ~~^~~~~~~~~~~~~~~~~~~~~
closing.cpp: In function 'long long int solve2(int, long long int, int, int)':
closing.cpp:186:23: warning: unused variable 'v' [-Wunused-variable]
  186 |             for (auto v : vec1)
      |                       ^

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 40472 KB Output is correct
2 Correct 169 ms 47436 KB Output is correct
3 Correct 79 ms 12476 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 6 ms 9724 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 5 ms 9640 KB Output is correct
19 Correct 6 ms 9812 KB Output is correct
20 Correct 4 ms 9812 KB Output is correct
21 Correct 6 ms 9736 KB Output is correct
22 Correct 5 ms 9812 KB Output is correct
23 Correct 4 ms 9812 KB Output is correct
24 Correct 6 ms 9812 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 6 ms 9724 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 5 ms 9640 KB Output is correct
19 Correct 6 ms 9812 KB Output is correct
20 Correct 4 ms 9812 KB Output is correct
21 Correct 6 ms 9736 KB Output is correct
22 Correct 5 ms 9812 KB Output is correct
23 Correct 4 ms 9812 KB Output is correct
24 Correct 6 ms 9812 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 8 ms 10256 KB Output is correct
27 Correct 6 ms 10236 KB Output is correct
28 Correct 6 ms 10324 KB Output is correct
29 Correct 9 ms 10196 KB Output is correct
30 Correct 5 ms 10196 KB Output is correct
31 Correct 6 ms 10324 KB Output is correct
32 Correct 5 ms 10324 KB Output is correct

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '9', found: '8'
10 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 6 ms 9724 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '9', found: '8'
22 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 6 ms 9724 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 5 ms 9640 KB Output is correct
20 Correct 6 ms 9812 KB Output is correct
21 Correct 4 ms 9812 KB Output is correct
22 Correct 6 ms 9736 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 4 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 4 ms 9684 KB Output is correct
27 Correct 4 ms 9684 KB Output is correct
28 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '9', found: '8'
29 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 6 ms 9724 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 5 ms 9640 KB Output is correct
20 Correct 6 ms 9812 KB Output is correct
21 Correct 4 ms 9812 KB Output is correct
22 Correct 6 ms 9736 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 4 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 8 ms 10256 KB Output is correct
28 Correct 6 ms 10236 KB Output is correct
29 Correct 6 ms 10324 KB Output is correct
30 Correct 9 ms 10196 KB Output is correct
31 Correct 5 ms 10196 KB Output is correct
32 Correct 6 ms 10324 KB Output is correct
33 Correct 5 ms 10324 KB Output is correct
34 Correct 4 ms 9684 KB Output is correct
35 Correct 4 ms 9684 KB Output is correct
36 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '9', found: '8'
37 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 4 ms 9684 KB Output is correct
14 Correct 6 ms 9724 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 5 ms 9640 KB Output is correct
20 Correct 6 ms 9812 KB Output is correct
21 Correct 4 ms 9812 KB Output is correct
22 Correct 6 ms 9736 KB Output is correct
23 Correct 5 ms 9812 KB Output is correct
24 Correct 4 ms 9812 KB Output is correct
25 Correct 6 ms 9812 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 8 ms 10256 KB Output is correct
28 Correct 6 ms 10236 KB Output is correct
29 Correct 6 ms 10324 KB Output is correct
30 Correct 9 ms 10196 KB Output is correct
31 Correct 5 ms 10196 KB Output is correct
32 Correct 6 ms 10324 KB Output is correct
33 Correct 5 ms 10324 KB Output is correct
34 Correct 4 ms 9684 KB Output is correct
35 Correct 4 ms 9684 KB Output is correct
36 Incorrect 4 ms 9684 KB 1st lines differ - on the 1st token, expected: '9', found: '8'
37 Halted 0 ms 0 KB -