oj.uz

답안 #541594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541594 2022-03-23T19:53:12 Z adespawn Mousetrap (CEOI17_mousetrap) C++14
45 / 100
 780 ms 56248 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();
}

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;
}

int illR;
map<long long, 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;
    long long k = (long long)w + (long long)a * (long long)1000000;
    if (mp[k] != 0)
        return mp[k];
    int lsp = 0, csp = 0;
    for (int i = min(a + 1, (int)v[w].size()) - 1; i >= 0; i--)
    {
        csp = v[w][i] + sp[w - 1] + max((int)(v[w].size() - i - 2), 0) + i;
        if (csp == lsp)
            continue;
        lsp = csp;
        int cll = solve2(w - 1, a - i + 1, max(miip - i, csp - i));
        mnw = min(max(csp - i, cll) + i, mnw);
        if (mnw < miip)
            break;
    }
    if (mnw == 100000000)
        mnw = 0;
    // cout << w << ' ' << a << ' ' << miip << ' ' << mnw << '\n';
    mp[k] = mnw;
    // illR++;
    // cout << illR << ' ' << flush;
    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);
    for (int i = 1; i <= n; i++)
        sc[i].clear();
    // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23780 KB Output is correct
4 Correct 12 ms 23736 KB Output is correct
5 Correct 12 ms 23804 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 12 ms 23724 KB Output is correct
8 Correct 13 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 55104 KB Output is correct
2 Correct 300 ms 51980 KB Output is correct
3 Correct 774 ms 56196 KB Output is correct
4 Correct 353 ms 39960 KB Output is correct
5 Correct 771 ms 56248 KB Output is correct
6 Correct 780 ms 56232 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23780 KB Output is correct
4 Correct 12 ms 23736 KB Output is correct
5 Correct 12 ms 23804 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 12 ms 23724 KB Output is correct
8 Correct 13 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 12 ms 23764 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 14 ms 23764 KB Output is correct
14 Correct 15 ms 24000 KB Output is correct
15 Correct 15 ms 23920 KB Output is correct
16 Correct 13 ms 23764 KB Output is correct
17 Incorrect 13 ms 23812 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 13 ms 23780 KB Output is correct
4 Correct 12 ms 23736 KB Output is correct
5 Correct 12 ms 23804 KB Output is correct
6 Correct 15 ms 23764 KB Output is correct
7 Correct 12 ms 23724 KB Output is correct
8 Correct 13 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 338 ms 55104 KB Output is correct
12 Correct 300 ms 51980 KB Output is correct
13 Correct 774 ms 56196 KB Output is correct
14 Correct 353 ms 39960 KB Output is correct
15 Correct 771 ms 56248 KB Output is correct
16 Correct 780 ms 56232 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 13 ms 23764 KB Output is correct
19 Correct 14 ms 23764 KB Output is correct
20 Correct 15 ms 24000 KB Output is correct
21 Correct 15 ms 23920 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Incorrect 13 ms 23812 KB Output isn't correct
24 Halted 0 ms 0 KB -