제출 #864068

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

closing

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Node = array<ll, 3>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int n;
vector<vector<pii> > graph;
vector<int> dist1, dist2;

void dfs(int u, int p, int a, int d) {
    if(a == 1) dist1[u] = d;
    else dist2[u] = d;

    for(pii &next : graph[u]) {
        int v = next.first;
        int w = next.second;
        if(v == p) continue;
        dfs(v, u, a, d + w);
    }
}

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    graph.clear();
    graph.resize(n);
    dist1.clear();
    dist1.resize(n);
    dist2.clear();
    dist2.resize(n);

    for(int i=0; i<n-1; i++) {
        graph[U[i]].push_back({ V[i], W[i] });
        graph[V[i]].push_back({ U[i], W[i]});
    }

    if(X > Y) swap(X, Y);
    dfs(X, 0, 1, 0);
    dfs(Y, 0, 2, 0);

    int ans = 0;

    for(int i=0; i<=X; i++) {
        for(int j=Y; j<n; j++) {
            for(int k=X+1; k<Y; k++) {
                for(int l=k; l<Y; l++) {
                    int ans2 = (j - i + 1) - (l - k + 1);
                    ll total = 0;

                    for(int x=i; x<=j; x++) {
                        if(x < k) total += min(dist1[x], dist2[x]);
                        if(x > l) total += min(dist1[x], dist2[x]);
                    } 

                    if(total <= K) ans = max(ans, ans2);
                }
            }
        }
    }

    for(int i=0; i<=X; i++) {
        for(int j=Y; j<n; j++) {
            for(int k=i; k<=j; k++) {
                for(int l=k; l<=j; l++) {
                    int ans2 = (j - i + 1) - (l - k + 1);
                    ll total = 0;

                    for(int x=i; x<=j; x++) {
                        if(x >= k && x <= l) total += max(dist1[x], dist2[x]);
                        else total += min(dist1[x], dist2[x]);
                    } 

                    if(total <= K) ans = max(ans, ans2);
                }
            }
        }
    }

    return ans;
}

// int32_t main() {
//     setIO();

//     

//     return 0;
// }

• 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