oj.uz

답안 #1077927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077927 2024-08-27T10:38:43 Z GrindMachine 자매 도시 (APIO20_swap) C++17
30 / 100
 2000 ms 52440 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define conts continue
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define ff first
#define ss second
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &x, T y){
    x = min(x,y);
}
 
template<typename T>
void amax(T &x, T y){
    x = max(x,y);
}
 
template<typename A,typename B>
string to_string(pair<A,B> p);
 
string to_string(const string &s){
    return "'"+s+"'";
}
 
string to_string(const char* s){
    return to_string((string)s);
}
 
string to_string(bool b){
    return b?"true":"false";
}
 
string to_string(vector<bool> v){
    string res = "{";
    rep(i,sz(v)){
        res += to_string(v[i])+",";
    }
    if(res.back() == ',') res.pop_back();
    res += "}";
    return res;
}
 
template<typename A>
string to_string(A v){
    string res = "{";
    trav(x,v){
        res += to_string(x)+",";
    }
    if(res.back() == ',') res.pop_back();
    res += "}";
    return res;
}
 
template<typename A,typename B>
string to_string(pair<A,B> p){
    return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}
 
#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;
 
#include "swap.h"
 
vector<int> par(N);
 
int find(int u){
    if(u == par[u]) return u;
    return par[u] = find(par[u]);
}
 
void merge(int u, int v){
    u = find(u), v = find(v);
    if(u == v) return;
    par[v] = u;
}
 
vector<pii> adj1[N], adj2[N];

const int LOG = 17;

int up[N][LOG], mxw[N][LOG];
vector<int> depth(N);

void dfs1(int u, int p){
    for(auto [v,w] : adj1[u]){
        if(v == p) conts;
        depth[v] = depth[u]+1;
        up[v][0] = u;
        mxw[v][0] = w;
        rep1(j,LOG-1){
            up[v][j] = up[up[v][j-1]][j-1];
            mxw[v][j] = max(mxw[v][j-1],mxw[up[v][j-1]][j-1]);
        }
        dfs1(v,u);
    }
}
 
int lift(int u, int k){
    rep(j,LOG){
        if(k&(1<<j)){
            u = up[u][j];
        }
    }
    return u;
}
 
int get_lca(int u, int v){
    if(depth[u] < depth[v]) swap(u,v);
    int k = depth[u]-depth[v];
    u = lift(u,k);
    if(u == v) return u;
 
    rev(j,LOG-1,0){
        if(up[u][j] != up[v][j]){
            u = up[u][j];
            v = up[v][j];
        }
    }
 
    u = up[u][0], v = up[v][0];
    assert(u == v);
    return u;
}

int get_mx(int u, int k){
    int mx = -inf1;
    rep(j,LOG){
        if(k&(1<<j)){
            amax(mx,mxw[u][j]);
            u = up[u][j];
        }
    }
    return mx;
}

vector<int> best(N,inf1);
vector<int> smallest_cyc(N,inf1);
vector<int> enter[N], leave[N];
multiset<int> ms[N];
vector<int> subsiz(N);

void dfs2(int u, int p){
    subsiz[u] = sz(enter[u]);
    for(auto [v,w] : adj1[u]){
        if(v == p) conts;
        dfs2(v,u);
        subsiz[u] += subsiz[v];
    }
}

void dfs3(int u, int p){
    pii best = {-1,-1};
    for(auto [v,w] : adj1[u]){
        if(v == p) conts;
        pii px = {subsiz[v],v};
        amax(best,px);
    }

    int heavy = best.ss;
    if(heavy != -1){
        dfs3(heavy,u);
        swap(ms[u],ms[heavy]);
    }

    for(auto [v,w] : adj1[u]){
        if(v == p or v == heavy) conts;
        trav(x,ms[v]){
            ms[u].insert(x);
        }
        ms[v].clear();
    }

    if(!ms[u].empty()){
        amin(smallest_cyc[u],*ms[u].begin());
    }

    trav(x,enter[u]){
        amin(smallest_cyc[u],x);
        ms[u].insert(x);
    }

    trav(x,leave[u]){
        rep1(iter,2){
            ms[u].erase(ms[u].find(x));
        }
    }
}

void init(int n, int m,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    
    vector<array<int,3>> edges;
    rep(i,m){
        edges.pb({W[i],U[i],V[i]});
    }
 
    sort(all(edges));
    vector<array<int,3>> span, non_span;
    iota(all(par),0);
 
    for(auto [w,u,v] : edges){
        if(find(u) != find(v)){
            span.pb({u,v,w});
            merge(u,v);
        }
        else{
            non_span.pb({u,v,w});
        }
    }
 
    for(auto [u,v,w] : span){
        adj1[u].pb({v,w}), adj1[v].pb({u,w});
    }
 
    for(auto [u,v,w] : non_span){
        adj2[u].pb({w,v}), adj2[v].pb({w,v});
    }
    
    dfs1(0,-1);
    
    rep(u,n){
        for(auto [v,w] : adj1[u]){
            adj2[u].pb({w,v});
        }
 
        sort(all(adj1[u]));
        sort(all(adj2[u]));
    }

    priority_queue<pii,vector<pii>,greater<pii>> pq;
    rep(i,n){
        if(sz(adj2[i]) >= 3){
            int val = 0;
            rep(j,3){
                amax(val,adj2[i][j].ff);
            }

            pq.push({val,i});
        }
    }

    vector<bool> vis(n);

    while(!pq.empty()){
        auto [cost,u] = pq.top();
        pq.pop();

        if(vis[u]) conts;
        vis[u] = 1;
        best[u] = cost;

        for(auto [w,v] : adj2[u]){
            pq.push({max(cost,w),v});
        }
    }

    for(auto [u,v,w] : non_span){
        int lca = get_lca(u,v);
        enter[u].pb(w), enter[v].pb(w);
        leave[lca].pb(w);
    }

    dfs2(0,-1);
    dfs3(0,-1);
}
 
int getMinimumFuelCapacity(int u, int v) {
    if(depth[u] > depth[v]) swap(u,v);
    int lca = get_lca(u,v);
 
    int du = depth[u]-depth[lca];
    int dv = depth[v]-depth[lca];
    int pmx = max(get_mx(u,du),get_mx(v,dv));
    
    int mn = min({best[u],best[v],smallest_cyc[u],smallest_cyc[v]});

    int ans = max(pmx,mn);
    if(ans == inf1) ans = -1;
 
    return ans;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16476 KB Output is correct
2 Correct 8 ms 16276 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 7 ms 16536 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 8 ms 16780 KB Output is correct
7 Correct 9 ms 16732 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Correct 88 ms 41796 KB Output is correct
10 Correct 109 ms 49368 KB Output is correct
11 Correct 113 ms 47956 KB Output is correct
12 Correct 157 ms 50204 KB Output is correct
13 Correct 103 ms 49524 KB Output is correct
14 Correct 105 ms 41252 KB Output is correct
15 Correct 242 ms 51536 KB Output is correct
16 Correct 233 ms 47864 KB Output is correct
17 Correct 221 ms 52440 KB Output is correct
18 Correct 239 ms 51012 KB Output is correct
19 Execution timed out 2067 ms 23860 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16476 KB Output is correct
2 Correct 8 ms 16276 KB Output is correct
3 Correct 161 ms 46084 KB Output is correct
4 Correct 189 ms 47724 KB Output is correct
5 Correct 168 ms 46912 KB Output is correct
6 Correct 161 ms 47424 KB Output is correct
7 Correct 156 ms 47212 KB Output is correct
8 Correct 164 ms 45892 KB Output is correct
9 Correct 157 ms 47172 KB Output is correct
10 Correct 158 ms 45892 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16476 KB Output is correct
2 Correct 8 ms 16276 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 7 ms 16536 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 8 ms 16780 KB Output is correct
7 Correct 9 ms 16732 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Runtime error 23 ms 33116 KB Execution killed with signal 6
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16476 KB Output is correct
2 Correct 8 ms 16276 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 7 ms 16536 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 8 ms 16780 KB Output is correct
7 Correct 9 ms 16732 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Correct 88 ms 41796 KB Output is correct
10 Correct 109 ms 49368 KB Output is correct
11 Correct 113 ms 47956 KB Output is correct
12 Correct 157 ms 50204 KB Output is correct
13 Correct 103 ms 49524 KB Output is correct
14 Correct 105 ms 41252 KB Output is correct
15 Correct 242 ms 51536 KB Output is correct
16 Correct 233 ms 47864 KB Output is correct
17 Correct 221 ms 52440 KB Output is correct
18 Correct 239 ms 51012 KB Output is correct
19 Correct 161 ms 46084 KB Output is correct
20 Correct 189 ms 47724 KB Output is correct
21 Correct 168 ms 46912 KB Output is correct
22 Correct 161 ms 47424 KB Output is correct
23 Correct 156 ms 47212 KB Output is correct
24 Correct 164 ms 45892 KB Output is correct
25 Correct 157 ms 47172 KB Output is correct
26 Correct 158 ms 45892 KB Output is correct
27 Correct 7 ms 16732 KB Output is correct
28 Correct 7 ms 16732 KB Output is correct
29 Correct 8 ms 16732 KB Output is correct
30 Correct 8 ms 16732 KB Output is correct
31 Correct 8 ms 16732 KB Output is correct
32 Correct 7 ms 16736 KB Output is correct
33 Correct 7 ms 16728 KB Output is correct
34 Correct 8 ms 16736 KB Output is correct
35 Correct 8 ms 16732 KB Output is correct
36 Correct 20 ms 20148 KB Output is correct
37 Correct 119 ms 47228 KB Output is correct
38 Correct 106 ms 44868 KB Output is correct
39 Correct 111 ms 42820 KB Output is correct
40 Correct 104 ms 42052 KB Output is correct
41 Correct 128 ms 41536 KB Output is correct
42 Correct 100 ms 40256 KB Output is correct
43 Correct 118 ms 45376 KB Output is correct
44 Correct 118 ms 46920 KB Output is correct
45 Correct 111 ms 48216 KB Output is correct
46 Correct 120 ms 43844 KB Output is correct
47 Correct 30 ms 20184 KB Output is correct
48 Correct 261 ms 49012 KB Output is correct
49 Correct 250 ms 46408 KB Output is correct
50 Correct 254 ms 45632 KB Output is correct
51 Correct 253 ms 45120 KB Output is correct
52 Correct 238 ms 43340 KB Output is correct
53 Correct 188 ms 37188 KB Output is correct
54 Correct 268 ms 47680 KB Output is correct
55 Correct 243 ms 48708 KB Output is correct
56 Correct 230 ms 51304 KB Output is correct
57 Correct 225 ms 46472 KB Output is correct

Subtask #6
0 / 27.0

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