oj.uz

답안 #1009823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1009823 2024-06-28T06:23:55 Z boris_mihov 봉쇄 시간 (IOI23_closing) C++17
51 / 100
 50 ms 51284 KB 
#include "closing.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
 
typedef long long llong;
const int MAXN = 2000 + 10;
const llong INF = 8e18;
const int INTINF = 2e9;
 
int n;
int x;
int y;
llong k;
int sz[MAXN];
int par[MAXN];
bool isOnPath[MAXN];
std::vector <int> path;
std::vector <int> pathSizes;
std::vector <std::pair <int,int>> g[MAXN];
std::vector <int> suffixSizes[MAXN];
llong dpR[MAXN][2 * MAXN][2][2]; // root
llong dpC[MAXN][2 * MAXN][2][2]; // children, knapsack
llong dpS[MAXN][2 * MAXN][2][2]; // stick
bool blR[MAXN][2 * MAXN][2][2];
bool blC[MAXN][2 * MAXN][2][2];
bool blS[MAXN][2 * MAXN][2][2];
llong distX[MAXN];
llong distY[MAXN];
 
void reset()
{
    path.clear();
    pathSizes.clear();
    for (int i = 0 ; i < n ; ++i)
    {
        g[i].clear();
        suffixSizes[i].clear();
        isOnPath[i] = false;
        distX[i] = distY[i] = 0;
        for (int j = 0 ; j <= 2 * n ; ++j)
        {
            for (int flagX = 0 ; flagX < 2 ; ++flagX)
            {
                for (int flagY = 0 ; flagY < 2 ; ++flagY)
                {
                    dpR[i][j][flagX][flagY] = 0;
                    dpC[i][j][flagX][flagY] = 0;
                    dpS[i][j][flagX][flagY] = 0;
                    blR[i][j][flagX][flagY] = false;
                    blC[i][j][flagX][flagY] = false;
                    blS[i][j][flagX][flagY] = false;
                }
            }
        }
    }
}
 
void dfs(int node, int par, llong to[], llong dist)
{
    to[node] = dist;
    for (const auto &[u, d] : g[node])
    {
        if (u == par)
        {
            continue;
        }
 
        dfs(u, node, to, dist + d);
    }
}
 
bool dfsPath(int node, int par)
{
    if (node == y)
    {
        path.push_back(node);
        return true;
    }
 
    for (const auto &[u, d] : g[node])
    {
        if (u == par)
        {
            continue;
        }
 
        if (dfsPath(u, node))
        {
            path.push_back(node);
            return true;
        }
    }
 
    return false;
}
 
void dfsSize(int node, int p)
{
    sz[node] = 1;
    par[node] = p;
    for (const auto &[u, d] : g[node])
    {
        if (p == u)
        {
            continue;
        }
 
        dfsSize(u, node);
        if (!isOnPath[u]) sz[node] += sz[u];
    }
}
 
llong fRoot(int, int, int, int);
llong fChildren(int, int, int, int, int);
llong fStick(int, int, int, int);
 
llong stepsRoot;
llong stepsChildren;
llong stepsStick;
llong fRoot(int node, int choose, int flagX, int flagY)
{
    stepsRoot++;
    if (choose == 0)
    {
        return 0;
    }
 
    if (!flagX && !flagY)
    {
        return k + 1;
    }
 
    if (blR[node][choose][flagX][flagY])
    {
        return dpR[node][choose][flagX][flagY];
    }
 
    blR[node][choose][flagX][flagY] = true;
    dpR[node][choose][flagX][flagY] = fChildren(node, 0, choose, flagX, flagY);
    dpR[node][choose][flagX][flagY] = std::min(dpR[node][choose][flagX][flagY], k + 1);
    return dpR[node][choose][flagX][flagY];
}
 
llong fChildren(int node, int idx, int choose, int flagX, int flagY)
{
    stepsChildren++;
    if (idx == g[node].size())
    {
        if (choose == 0) return 0;
        return k + 1;
    }
 
    int current = g[node][idx].first;
    if (isOnPath[current] || current == par[node])
    {
        return fChildren(node, idx + 1, choose, flagX, flagY);
    }
 
    if (blC[current][choose][flagX][flagY])
    {
        return dpC[current][choose][flagX][flagY];
    }
    
    blC[current][choose][flagX][flagY] = true;
    dpC[current][choose][flagX][flagY] = k + 1;
    
    for (int currX = 0 ; currX <= flagX ; ++currX)
    {
        for (int currY = 0 ; currY <= flagY ; ++currY)
        {
            for (int subtreeChoose = std::max(choose - (flagX + flagY) * suffixSizes[node][idx + 1], currX + currY) ; subtreeChoose <= std::min((currX + currY) * sz[g[node][idx].first], choose) ; ++subtreeChoose)
            {
                stepsChildren++;
                dpC[current][choose][flagX][flagY] = std::min(dpC[current][choose][flagX][flagY], fChildren(node, idx + 1, choose - subtreeChoose, flagX, flagY) + std::max((currX == 0 ? 0 : distX[current]), (currY == 0 ? 0 : distY[current])) + fRoot(current, subtreeChoose - currX - currY, currX, currY));
            }
        }
    }
 
    return dpC[current][choose][flagX][flagY];
}
 
llong fStick(int idx, int choose, int flagX, int flagY)
{
    stepsStick++;
    if (idx == path.size())
    {
        if (choose == 0) return 0;
        return k + 1;
    }
 
    if (blS[idx][choose][flagX][flagY])
    {
        return dpS[idx][choose][flagX][flagY];
    }
 
    blS[idx][choose][flagX][flagY] = true;
    dpS[idx][choose][flagX][flagY] = k + 1;
    for (int currX = 0 ; currX <= flagX ; ++currX)
    {
        for (int currY = flagY ; currY <= 1 ; ++currY)
        {
            for (int subtreeChoose = std::max(choose - 2 * pathSizes[idx + 1], currX + currY) ; subtreeChoose <= std::min(2 * sz[path[idx]], choose) ; ++subtreeChoose)
            {
                stepsStick++;
                int val = dpS[idx][choose][flagX][flagY];
                dpS[idx][choose][flagX][flagY] = std::min(dpS[idx][choose][flagX][flagY], fStick(idx + 1, choose - subtreeChoose, currX, currY) + std::max((currX == 0 ? 0 : distX[path[idx]]), (currY == 0 ? 0 : distY[path[idx]])) + fRoot(path[idx], subtreeChoose - currX - currY, currX, currY));
            }
        }
    }
 
    return dpS[idx][choose][flagX][flagY];
}
 
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 = N;
    x = X;
    y = Y;
    k = K;
 
    for (int i = 0 ; i < n - 1 ; ++i)
    {
        g[U[i]].emplace_back(V[i], W[i]);
        g[V[i]].emplace_back(U[i], W[i]);
    }    
 
    dfs(x, -1, distX, 0);
    dfs(y, -1, distY, 0);
    dfsPath(x, -1);
 
    std::reverse(path.begin(), path.end());
    for (const int &i : path)
    {
        isOnPath[i] = true;
    }
 
    dfsSize(x, -1);
    for (int i = 0 ; i < n ; ++i)
    {
        suffixSizes[i].resize(g[i].size() + 1, 0);
        for (int j = g[i].size() - 1 ; j >= 0 ; --j)
        {
            int add = 0;
            suffixSizes[i][j] = suffixSizes[i][j + 1];
            if (!isOnPath[g[i][j].first] && g[i][j].first != par[i])
            {
                add = sz[g[i][j].first];
            }
 
            suffixSizes[i][j] += add;
        }
    }

    pathSizes.resize(path.size() + 1, 0);
    for (int i = path.size() - 1 ; i >= 0 ; --i)
    {
        pathSizes[i] = pathSizes[i + 1] + sz[path[i]];
    }

    for (int i = 2 * n ; i >= 1 ; --i)
    {
        if (fStick(0, i, 1, 0) <= k)
        {
            return i;
        }
    }
 
    return 0;
}

Compilation message

closing.cpp: In function 'llong fChildren(int, int, int, int, int)':
closing.cpp:151:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |     if (idx == g[node].size())
      |         ~~~~^~~~~~~~~~~~~~~~~
closing.cpp: In function 'llong fStick(int, int, int, int)':
closing.cpp:189:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  189 |     if (idx == path.size())
      |         ~~~~^~~~~~~~~~~~~~
closing.cpp:209:21: warning: unused variable 'val' [-Wunused-variable]
  209 |                 int val = dpS[idx][choose][flagX][flagY];
      |                     ^~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 49 ms 8780 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 1 ms 8028 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 4 ms 8280 KB Output is correct
17 Correct 3 ms 8128 KB Output is correct
18 Correct 2 ms 7088 KB Output is correct
19 Correct 14 ms 14940 KB Output is correct
20 Correct 26 ms 21124 KB Output is correct
21 Correct 10 ms 10076 KB Output is correct
22 Correct 48 ms 24660 KB Output is correct
23 Correct 48 ms 21072 KB Output is correct
24 Correct 50 ms 21116 KB Output is correct

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 8280 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 1 ms 8028 KB Output is correct
15 Correct 2 ms 8284 KB Output is correct
16 Correct 4 ms 8280 KB Output is correct
17 Correct 3 ms 8128 KB Output is correct
18 Correct 2 ms 7088 KB Output is correct
19 Correct 14 ms 14940 KB Output is correct
20 Correct 26 ms 21124 KB Output is correct
21 Correct 10 ms 10076 KB Output is correct
22 Correct 48 ms 24660 KB Output is correct
23 Correct 48 ms 21072 KB Output is correct
24 Correct 50 ms 21116 KB Output is correct
25 Correct 11 ms 8024 KB Output is correct
26 Runtime error 11 ms 604 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 1 ms 6744 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6692 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 796 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 860 KB Output is correct
24 Correct 0 ms 604 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 8280 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8028 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 4 ms 8280 KB Output is correct
18 Correct 3 ms 8128 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6692 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 796 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 1 ms 6744 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 860 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 2 ms 1996 KB Output is correct
39 Correct 1 ms 1884 KB Output is correct
40 Correct 1 ms 1624 KB Output is correct
41 Correct 2 ms 1884 KB Output is correct
42 Correct 2 ms 1884 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 2 ms 1628 KB Output is correct
45 Correct 3 ms 7744 KB Output is correct
46 Correct 2 ms 8028 KB Output is correct
47 Correct 3 ms 7768 KB Output is correct
48 Correct 1 ms 1628 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 7004 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 8280 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8028 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 4 ms 8280 KB Output is correct
18 Correct 3 ms 8128 KB Output is correct
19 Correct 2 ms 7088 KB Output is correct
20 Correct 14 ms 14940 KB Output is correct
21 Correct 26 ms 21124 KB Output is correct
22 Correct 10 ms 10076 KB Output is correct
23 Correct 48 ms 24660 KB Output is correct
24 Correct 48 ms 21072 KB Output is correct
25 Correct 50 ms 21116 KB Output is correct
26 Correct 1 ms 6744 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 1 ms 6692 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 0 ms 796 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 6744 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 ms 604 KB Output is correct
42 Correct 0 ms 860 KB Output is correct
43 Correct 0 ms 604 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 2 ms 1996 KB Output is correct
46 Correct 1 ms 1884 KB Output is correct
47 Correct 1 ms 1624 KB Output is correct
48 Correct 2 ms 1884 KB Output is correct
49 Correct 2 ms 1884 KB Output is correct
50 Correct 2 ms 2140 KB Output is correct
51 Correct 2 ms 1628 KB Output is correct
52 Correct 3 ms 7744 KB Output is correct
53 Correct 2 ms 8028 KB Output is correct
54 Correct 3 ms 7768 KB Output is correct
55 Correct 1 ms 1628 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 1 ms 7004 KB Output is correct
58 Correct 4 ms 7260 KB Output is correct
59 Correct 7 ms 10336 KB Output is correct
60 Correct 6 ms 10844 KB Output is correct
61 Correct 13 ms 14604 KB Output is correct
62 Correct 12 ms 14424 KB Output is correct
63 Correct 6 ms 13916 KB Output is correct
64 Correct 4 ms 12892 KB Output is correct
65 Correct 35 ms 13144 KB Output is correct
66 Correct 16 ms 14272 KB Output is correct
67 Correct 21 ms 14940 KB Output is correct
68 Correct 48 ms 18256 KB Output is correct
69 Correct 25 ms 16212 KB Output is correct
70 Correct 31 ms 15188 KB Output is correct
71 Correct 49 ms 16468 KB Output is correct
72 Correct 31 ms 13404 KB Output is correct
73 Correct 18 ms 47004 KB Output is correct
74 Correct 31 ms 51284 KB Output is correct
75 Correct 4 ms 10844 KB Output is correct

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 8280 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8028 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 4 ms 8280 KB Output is correct
18 Correct 3 ms 8128 KB Output is correct
19 Correct 2 ms 7088 KB Output is correct
20 Correct 14 ms 14940 KB Output is correct
21 Correct 26 ms 21124 KB Output is correct
22 Correct 10 ms 10076 KB Output is correct
23 Correct 48 ms 24660 KB Output is correct
24 Correct 48 ms 21072 KB Output is correct
25 Correct 50 ms 21116 KB Output is correct
26 Correct 11 ms 8024 KB Output is correct
27 Runtime error 11 ms 604 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 8280 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 1 ms 8028 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 4 ms 8280 KB Output is correct
18 Correct 3 ms 8128 KB Output is correct
19 Correct 2 ms 7088 KB Output is correct
20 Correct 14 ms 14940 KB Output is correct
21 Correct 26 ms 21124 KB Output is correct
22 Correct 10 ms 10076 KB Output is correct
23 Correct 48 ms 24660 KB Output is correct
24 Correct 48 ms 21072 KB Output is correct
25 Correct 50 ms 21116 KB Output is correct
26 Correct 11 ms 8024 KB Output is correct
27 Runtime error 11 ms 604 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -