oj.uz

답안 #541593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541593 2022-03-23T19:44:08 Z adespawn Mousetrap (CEOI17_mousetrap) C++14
65 / 100
 4304 ms 524288 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, 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, miip}}] != 0)
        return mp[{w, {a, miip}}];
    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;
        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[{w, {a, miip}}] = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23792 KB Output is correct
7 Correct 13 ms 23808 KB Output is correct
8 Correct 14 ms 23892 KB Output is correct
9 Correct 14 ms 23812 KB Output is correct
10 Correct 13 ms 23808 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 55096 KB Output is correct
2 Correct 298 ms 51928 KB Output is correct
3 Correct 790 ms 56300 KB Output is correct
4 Correct 377 ms 40012 KB Output is correct
5 Correct 783 ms 56308 KB Output is correct
6 Correct 824 ms 56196 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23792 KB Output is correct
7 Correct 13 ms 23808 KB Output is correct
8 Correct 14 ms 23892 KB Output is correct
9 Correct 14 ms 23812 KB Output is correct
10 Correct 13 ms 23808 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23776 KB Output is correct
13 Correct 13 ms 23812 KB Output is correct
14 Correct 13 ms 23936 KB Output is correct
15 Correct 13 ms 23972 KB Output is correct
16 Correct 13 ms 23764 KB Output is correct
17 Correct 13 ms 23816 KB Output is correct
18 Correct 14 ms 23816 KB Output is correct
19 Correct 13 ms 23936 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23764 KB Output is correct
22 Correct 12 ms 23816 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23792 KB Output is correct
7 Correct 13 ms 23808 KB Output is correct
8 Correct 14 ms 23892 KB Output is correct
9 Correct 14 ms 23812 KB Output is correct
10 Correct 13 ms 23808 KB Output is correct
11 Correct 356 ms 55096 KB Output is correct
12 Correct 298 ms 51928 KB Output is correct
13 Correct 790 ms 56300 KB Output is correct
14 Correct 377 ms 40012 KB Output is correct
15 Correct 783 ms 56308 KB Output is correct
16 Correct 824 ms 56196 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 13 ms 23776 KB Output is correct
19 Correct 13 ms 23812 KB Output is correct
20 Correct 13 ms 23936 KB Output is correct
21 Correct 13 ms 23972 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 13 ms 23816 KB Output is correct
24 Correct 14 ms 23816 KB Output is correct
25 Correct 13 ms 23936 KB Output is correct
26 Correct 13 ms 23764 KB Output is correct
27 Correct 13 ms 23764 KB Output is correct
28 Correct 12 ms 23816 KB Output is correct
29 Correct 14 ms 23812 KB Output is correct
30 Correct 341 ms 68448 KB Output is correct
31 Correct 335 ms 68492 KB Output is correct
32 Correct 436 ms 253512 KB Output is correct
33 Correct 379 ms 209456 KB Output is correct
34 Correct 783 ms 69308 KB Output is correct
35 Correct 778 ms 69428 KB Output is correct
36 Correct 956 ms 114368 KB Output is correct
37 Correct 825 ms 95680 KB Output is correct
38 Correct 777 ms 110968 KB Output is correct
39 Runtime error 4304 ms 524288 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -