oj.uz

Submission #541581

# Submission time Handle Problem Language Result Execution time Memory
541581 2022-03-23T19:23:44 Z adespawn Mousetrap (CEOI17_mousetrap) C++14
45 / 100
 758 ms 56652 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> sc[1000006];
bool isS[1000006];

int n, m, k;

int solve(int w, int f, int a = 1)
{
    priority_queue<int> k;
    if (w == m)
        return 0;
    for (auto i : sc[w])
    {
        if (i == f || isS[i])
            continue;
        k.push(solve(i, w));
    }
    while (k.size() < a + 1)
        k.push(0);
    for (int i = 0; (i < a) && (k.size() > 1); i++)
        k.pop();
    return sc[w].size() - 1 + k.top();
}

stack<pair<int, int>> s;

int nw;

vector<vector<int>> v;
vector<int> sp;

int dfs(int w, int f = 0, int g = 1, int z = 0)
{
    if (w == m)
    {
        v.push_back(sp);
        sp.push_back(0);
        return 1;
    }
    for (auto i : sc[w])
    {
        if (i == f)
            continue;
        int x = dfs(i, w, g + 1, z + sc[w].size() - 2 + (f == 0));
        if (x == 0)
            continue;
        isS[i] = 1;
        vector<int> tv;
        for (auto j : sc[w])
        {
            if (j == f || i == j)
                continue;
            tv.push_back(solve(j, w) + 1);
        }
        tv.push_back(0);
        sort(tv.begin(), tv.end());
        reverse(tv.begin(), tv.end());
        int z = sp.back() + tv.size() - 1;
        sp.push_back(z);
        v.push_back(tv);
        // cout << w << ' ' << sp.back() << '\n';
        // for (auto j : tv)
        //     cout << j << ' ';
        // cout << '\n';
        return 1;
    }
    return 0;
}

map<pair<int, int>, int> mp;
int solve2(int w, int a, int miip=0)
{
    if (w == 0 || a == 0)
        return 0;
    if (w + a - 1 >= sp[w])
        return sp[w];
    int mnw = 100000000;
    if (mp[{w, a}] != 0)
        return mp[{w, a}];
    int lsp = 0, csp = 0;
    for (int i = 0; i < min(a + 1, (int)v[w].size()); i++)
    {
        csp = v[w][i] + sp[w - 1] + max((int)(v[w].size() - i - 2), 0) + i;
        if (csp == lsp)
            continue;
        lsp = csp;
        mnw = min(max(csp - i, solve2(w - 1, a - i + 1, max(miip, csp - i))) + i, mnw);
        if (csp - i < miip)
            break;
    }
    mp[{w, a}] = mnw;
    return mnw;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++)
    {
        int a, b;
        cin >> a >> b;
        sc[a].push_back(b);
        sc[b].push_back(a);
    }
    dfs(k);
    // cout << nw - 1 << '\n';
    // s.push({0, 0});
    cout << solve2(sp.size() - 1, 1);
}

Compilation message

mousetrap.cpp: In function 'int solve(int, int, int)':
mousetrap.cpp:20:21: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     while (k.size() < a + 1)
      |            ~~~~~~~~~^~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 13 ms 23692 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 11 ms 23808 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 15 ms 23704 KB Output is correct
9 Correct 12 ms 23688 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 55384 KB Output is correct
2 Correct 301 ms 52336 KB Output is correct
3 Correct 747 ms 56496 KB Output is correct
4 Correct 359 ms 40340 KB Output is correct
5 Correct 758 ms 56604 KB Output is correct
6 Correct 748 ms 56652 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 13 ms 23692 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 11 ms 23808 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 15 ms 23704 KB Output is correct
9 Correct 12 ms 23688 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 11 ms 23764 KB Output is correct
12 Correct 14 ms 23820 KB Output is correct
13 Correct 12 ms 23800 KB Output is correct
14 Correct 13 ms 24004 KB Output is correct
15 Correct 12 ms 23964 KB Output is correct
16 Correct 13 ms 23860 KB Output is correct
17 Incorrect 13 ms 23764 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 13 ms 23692 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 11 ms 23808 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 15 ms 23704 KB Output is correct
9 Correct 12 ms 23688 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 328 ms 55384 KB Output is correct
12 Correct 301 ms 52336 KB Output is correct
13 Correct 747 ms 56496 KB Output is correct
14 Correct 359 ms 40340 KB Output is correct
15 Correct 758 ms 56604 KB Output is correct
16 Correct 748 ms 56652 KB Output is correct
17 Correct 11 ms 23764 KB Output is correct
18 Correct 14 ms 23820 KB Output is correct
19 Correct 12 ms 23800 KB Output is correct
20 Correct 13 ms 24004 KB Output is correct
21 Correct 12 ms 23964 KB Output is correct
22 Correct 13 ms 23860 KB Output is correct
23 Incorrect 13 ms 23764 KB Output isn't correct
24 Halted 0 ms 0 KB -