제출 #843666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843666		Boas	봉쇄 시간 (IOI23_closing)	C++17	0 / 100	1078 ms	45804 KiB

closing

#include "closing.h"
using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef set<ii> sii;
typedef vector<sii> vsii;
typedef tuple<ll, ll, ll, bool> item;

#define ALL(x) (x).begin(), x.end()
#define loop(x, i) for (int i = 0; i < x; i++)

void getDist(int i, ll d, vi &dist, const vsii &adj)
{
    dist[i] = d;
    for (auto [j, w] : adj[i])
    {
        if (dist[j] != -1)
            continue;
        getDist(j, dist[i] + w, dist, adj);
    }
}

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    vsii adj(N);
    loop(N - 1, i)
    {
        adj[U[i]].insert({V[i], W[i]});
        adj[V[i]].insert({U[i], W[i]});
    }
    vi distX(N, -1), distY(N, -1);
    distX[X] = 0;
    distY[Y] = 0;
    getDist(X, 0, distX, adj);
    getDist(Y, 0, distY, adj);
    int max = 0;
    vb visX(N);
    vb visY(N);
    for (int xleft = X; xleft >= 0; xleft--)
    {
        for (int xright = X; xright < N; xright++)
        {
            for (int yleft = Y; yleft >= 0; yleft--)
            {
                ll sum = 0;
                for (int i = 0; i < Y; i++)
                {
                    ll v = 0;
                    if (xleft <= i && i <= xright)
                    {
                        v = std::max(v, distX[i]);
                    }
                    if (yleft <= i)
                    {
                        v = std::max(v, distY[i]);
                    }
                    sum += v;
                }
                for (int yright = Y; yright < N; yright++)
                {
                    ll v = distY[yright];
                    if (xright >= yright)
                        v = std::max(v, distX[yright]);
                    sum += v;
                    if (K - sum < 0)
                        break;
                    int count = xright - xleft + 2 + yright - yleft;
                    if (count > max)
                    {
                        cerr << "Solution has: " << xleft << ' ' << xright << ' ' << yleft << ' ' << yright << endl;
                        max = count;
                    }
                }
            }
        }
    }
    cerr << endl;
    return max;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17