oj.uz

답안 #1111301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111301 2024-11-12T02:20:13 Z ljtunas 공장들 (JOI14_factories) C++17
100 / 100
 3465 ms 397488 KB 
// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;

//#define int long long

int sz[MAXN], p[MAXN]; bool del[MAXN]; ll d[MAXN];
vector<ii> g[MAXN];

void dfsSize(int u, int par)
{
    sz[u] = 1;
    for(auto [v, w] : g[u]) if((v ^ par) && !del[v]){
        dfsSize(v, u);
        sz[u] += sz[v];
    }
}

int find(int u, int par, int n)
{
    for(auto [v, w] : g[u])if(v ^ par){
        if(sz[v] > n / 2 && !del[v]) return find(v, u, n);
    }
    return u;
}

vector<ii> List[MAXN];

void prepare(int u, int par, ll len, int root)
{
    List[u].push_back({root, len});
    for(auto [v, w] : g[u]) if(v != par && !del[v]) prepare(v, u, len + w, root);
}

void buildCentroid(int u, int par)
{
    dfsSize(u, par);
    int c = find(u, par, sz[u]);
    del[c] = true;
    p[c] = par;
    prepare(c, 0, 0, c);
    for(auto [v, _] : g[c]) if((v ^ par) && !del[v]) {
        buildCentroid(v, c);
    }
}

long long Query(int S, int X[], int T, int Y[]){

//    cin >> S;cin >> T;
//    For(i, 0, S - 1) cin >> X[i];For(i, 0, T - 1) cin >> Y[i];

    For(i, 0, S - 1){
        for(auto [par, w] : List[X[i] + 1]) minimize(d[par], w);
    }
    ll ans = oo;
    For(i, 0, T - 1){
        int u = Y[i] + 1;
        for(auto [par, w] : List[u]){
            minimize(ans, d[par] + w);
        }
    }
    For(i, 0, S - 1){
        for(auto [par, w] : List[X[i] + 1]) d[par] = oo;
    }
    return ans;
}

int n, a[MAXN], b[MAXN], w[MAXN], S, T, x[MAXN], y[MAXN];

void Init(int n, int a[], int b[], int w[]){


//    cin >> n;
//    int q; cin >> q;
//    For(i, 0, n - 2) {
//        cin >> a[i] >> b[i] >> w[i];
//    }



    For(i, 0, n - 2){
        ++a[i], ++b[i];
        g[a[i]].push_back({b[i], w[i]});
        g[b[i]].push_back({a[i], w[i]});
    }
    For(i, 0, n + 5) d[i] = oo;
    buildCentroid(1, 0);



//    while(q--){
//        cout << Query(S, x, T, y) << '\n';
//    }
}

//void Solve() {
//    Init(n, a, b, w);
//}
//
//int32_t main() {
//    cin.tie(0) -> sync_with_stdio(0);
//    if(fopen("JOI14_factories.inp", "r")) {
//        freopen("JOI14_factories.inp", "r", stdin);
//        freopen("JOI14_factories.out", "w", stdout);
//    }
//
//    int t = 1;
////    cin >> t;
//
//    for (int test = 1; test <= t; test++) {
//        Solve();
//    }
//    return 0;
//}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47696 KB Output is correct
2 Correct 228 ms 56396 KB Output is correct
3 Correct 244 ms 61768 KB Output is correct
4 Correct 239 ms 61000 KB Output is correct
5 Correct 263 ms 62216 KB Output is correct
6 Correct 182 ms 59816 KB Output is correct
7 Correct 250 ms 61128 KB Output is correct
8 Correct 252 ms 61000 KB Output is correct
9 Correct 272 ms 62280 KB Output is correct
10 Correct 175 ms 59720 KB Output is correct
11 Correct 248 ms 62032 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47440 KB Output is correct
2 Correct 1631 ms 232512 KB Output is correct
3 Correct 2490 ms 296876 KB Output is correct
4 Correct 610 ms 126792 KB Output is correct
5 Correct 2692 ms 366576 KB Output is correct
6 Correct 2727 ms 294484 KB Output is correct
7 Correct 766 ms 101324 KB Output is correct
8 Correct 288 ms 76976 KB Output is correct
9 Correct 799 ms 116228 KB Output is correct
10 Correct 666 ms 102336 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 47696 KB Output is correct
2 Correct 228 ms 56396 KB Output is correct
3 Correct 244 ms 61768 KB Output is correct
4 Correct 239 ms 61000 KB Output is correct
5 Correct 263 ms 62216 KB Output is correct
6 Correct 182 ms 59816 KB Output is correct
7 Correct 250 ms 61128 KB Output is correct
8 Correct 252 ms 61000 KB Output is correct
9 Correct 272 ms 62280 KB Output is correct
10 Correct 175 ms 59720 KB Output is correct
11 Correct 248 ms 62032 KB Output is correct
12 Correct 30 ms 47440 KB Output is correct
13 Correct 1631 ms 232512 KB Output is correct
14 Correct 2490 ms 296876 KB Output is correct
15 Correct 610 ms 126792 KB Output is correct
16 Correct 2692 ms 366576 KB Output is correct
17 Correct 2727 ms 294484 KB Output is correct
18 Correct 766 ms 101324 KB Output is correct
19 Correct 288 ms 76976 KB Output is correct
20 Correct 799 ms 116228 KB Output is correct
21 Correct 666 ms 102336 KB Output is correct
22 Correct 1843 ms 236124 KB Output is correct
23 Correct 1904 ms 249328 KB Output is correct
24 Correct 3148 ms 317456 KB Output is correct
25 Correct 3237 ms 324628 KB Output is correct
26 Correct 2608 ms 320488 KB Output is correct
27 Correct 3465 ms 397488 KB Output is correct
28 Correct 706 ms 146040 KB Output is correct
29 Correct 2690 ms 317660 KB Output is correct
30 Correct 2553 ms 321488 KB Output is correct
31 Correct 2798 ms 321872 KB Output is correct
32 Correct 732 ms 122952 KB Output is correct
33 Correct 287 ms 84368 KB Output is correct
34 Correct 485 ms 100680 KB Output is correct
35 Correct 466 ms 99912 KB Output is correct
36 Correct 585 ms 107088 KB Output is correct
37 Correct 543 ms 109128 KB Output is correct