oj.uz

Submission #1077934

# Submission time Handle Problem Language Result Execution time Memory
1077934 2024-08-27T10:44:14 Z GrindMachine Swapping Cities (APIO20_swap) C++17
100 / 100
 481 ms 73408 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){
    for(auto [v,w] : adj1[u]){
        if(v == p) conts;
        dfs3(v,u);
        if(sz(ms[v]) > sz(ms[u])){
            swap(ms[u],ms[v]);
        }
        trav(x,ms[v]){
            ms[u].insert(x);
        }
        ms[v].clear();
    }

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

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

    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
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16476 KB Output is correct
2 Correct 8 ms 16476 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 8 ms 16476 KB Output is correct
5 Correct 9 ms 16700 KB Output is correct
6 Correct 8 ms 16732 KB Output is correct
7 Correct 7 ms 16592 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Correct 85 ms 41480 KB Output is correct
10 Correct 115 ms 49216 KB Output is correct
11 Correct 111 ms 47780 KB Output is correct
12 Correct 123 ms 50244 KB Output is correct
13 Correct 114 ms 52844 KB Output is correct
14 Correct 99 ms 40516 KB Output is correct
15 Correct 246 ms 50408 KB Output is correct
16 Correct 246 ms 47048 KB Output is correct
17 Correct 228 ms 54624 KB Output is correct
18 Correct 242 ms 52308 KB Output is correct
19 Correct 86 ms 25180 KB Output is correct
20 Correct 261 ms 53600 KB Output is correct
21 Correct 244 ms 51012 KB Output is correct
22 Correct 262 ms 55364 KB Output is correct
23 Correct 251 ms 55872 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16476 KB Output is correct
2 Correct 8 ms 16476 KB Output is correct
3 Correct 161 ms 44072 KB Output is correct
4 Correct 160 ms 45376 KB Output is correct
5 Correct 157 ms 44612 KB Output is correct
6 Correct 168 ms 45380 KB Output is correct
7 Correct 157 ms 44872 KB Output is correct
8 Correct 158 ms 43844 KB Output is correct
9 Correct 157 ms 44872 KB Output is correct
10 Correct 151 ms 43588 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16476 KB Output is correct
2 Correct 8 ms 16476 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 8 ms 16476 KB Output is correct
5 Correct 9 ms 16700 KB Output is correct
6 Correct 8 ms 16732 KB Output is correct
7 Correct 7 ms 16592 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Correct 8 ms 16476 KB Output is correct
10 Correct 11 ms 16732 KB Output is correct
11 Correct 9 ms 16692 KB Output is correct
12 Correct 8 ms 16728 KB Output is correct
13 Correct 8 ms 16732 KB Output is correct
14 Correct 8 ms 16732 KB Output is correct
15 Correct 8 ms 16732 KB Output is correct
16 Correct 7 ms 16732 KB Output is correct
17 Correct 8 ms 16732 KB Output is correct
18 Correct 8 ms 16732 KB Output is correct
19 Correct 9 ms 16788 KB Output is correct
20 Correct 9 ms 16732 KB Output is correct
21 Correct 9 ms 16624 KB Output is correct
22 Correct 10 ms 16704 KB Output is correct
23 Correct 9 ms 16732 KB Output is correct
24 Correct 10 ms 16988 KB Output is correct
25 Correct 9 ms 16784 KB Output is correct
26 Correct 9 ms 16880 KB Output is correct
27 Correct 9 ms 16776 KB Output is correct
28 Correct 10 ms 16988 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16476 KB Output is correct
2 Correct 7 ms 16476 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 8 ms 16476 KB Output is correct
5 Correct 8 ms 16476 KB Output is correct
6 Correct 9 ms 16700 KB Output is correct
7 Correct 8 ms 16732 KB Output is correct
8 Correct 7 ms 16592 KB Output is correct
9 Correct 8 ms 16732 KB Output is correct
10 Correct 85 ms 41480 KB Output is correct
11 Correct 115 ms 49216 KB Output is correct
12 Correct 111 ms 47780 KB Output is correct
13 Correct 123 ms 50244 KB Output is correct
14 Correct 114 ms 52844 KB Output is correct
15 Correct 11 ms 16732 KB Output is correct
16 Correct 9 ms 16692 KB Output is correct
17 Correct 8 ms 16728 KB Output is correct
18 Correct 8 ms 16732 KB Output is correct
19 Correct 8 ms 16732 KB Output is correct
20 Correct 8 ms 16732 KB Output is correct
21 Correct 7 ms 16732 KB Output is correct
22 Correct 8 ms 16732 KB Output is correct
23 Correct 8 ms 16732 KB Output is correct
24 Correct 9 ms 16788 KB Output is correct
25 Correct 9 ms 16732 KB Output is correct
26 Correct 9 ms 16624 KB Output is correct
27 Correct 10 ms 16704 KB Output is correct
28 Correct 9 ms 16732 KB Output is correct
29 Correct 10 ms 16988 KB Output is correct
30 Correct 9 ms 16784 KB Output is correct
31 Correct 9 ms 16880 KB Output is correct
32 Correct 9 ms 16776 KB Output is correct
33 Correct 10 ms 16988 KB Output is correct
34 Correct 21 ms 19928 KB Output is correct
35 Correct 135 ms 49216 KB Output is correct
36 Correct 122 ms 45160 KB Output is correct
37 Correct 121 ms 42056 KB Output is correct
38 Correct 120 ms 41280 KB Output is correct
39 Correct 118 ms 40960 KB Output is correct
40 Correct 111 ms 39244 KB Output is correct
41 Correct 134 ms 46400 KB Output is correct
42 Correct 121 ms 48192 KB Output is correct
43 Correct 116 ms 50244 KB Output is correct
44 Correct 128 ms 42440 KB Output is correct
45 Correct 269 ms 53024 KB Output is correct
46 Correct 128 ms 45488 KB Output is correct
47 Correct 114 ms 42816 KB Output is correct
48 Correct 146 ms 45376 KB Output is correct
49 Correct 257 ms 46920 KB Output is correct
50 Correct 212 ms 41632 KB Output is correct
51 Correct 242 ms 47812 KB Output is correct
52 Correct 292 ms 59832 KB Output is correct
53 Correct 292 ms 58564 KB Output is correct
54 Correct 384 ms 71208 KB Output is correct
55 Correct 123 ms 54304 KB Output is correct
56 Correct 315 ms 58048 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16476 KB Output is correct
2 Correct 8 ms 16476 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 8 ms 16476 KB Output is correct
5 Correct 9 ms 16700 KB Output is correct
6 Correct 8 ms 16732 KB Output is correct
7 Correct 7 ms 16592 KB Output is correct
8 Correct 8 ms 16732 KB Output is correct
9 Correct 85 ms 41480 KB Output is correct
10 Correct 115 ms 49216 KB Output is correct
11 Correct 111 ms 47780 KB Output is correct
12 Correct 123 ms 50244 KB Output is correct
13 Correct 114 ms 52844 KB Output is correct
14 Correct 99 ms 40516 KB Output is correct
15 Correct 246 ms 50408 KB Output is correct
16 Correct 246 ms 47048 KB Output is correct
17 Correct 228 ms 54624 KB Output is correct
18 Correct 242 ms 52308 KB Output is correct
19 Correct 161 ms 44072 KB Output is correct
20 Correct 160 ms 45376 KB Output is correct
21 Correct 157 ms 44612 KB Output is correct
22 Correct 168 ms 45380 KB Output is correct
23 Correct 157 ms 44872 KB Output is correct
24 Correct 158 ms 43844 KB Output is correct
25 Correct 157 ms 44872 KB Output is correct
26 Correct 151 ms 43588 KB Output is correct
27 Correct 11 ms 16732 KB Output is correct
28 Correct 9 ms 16692 KB Output is correct
29 Correct 8 ms 16728 KB Output is correct
30 Correct 8 ms 16732 KB Output is correct
31 Correct 8 ms 16732 KB Output is correct
32 Correct 8 ms 16732 KB Output is correct
33 Correct 7 ms 16732 KB Output is correct
34 Correct 8 ms 16732 KB Output is correct
35 Correct 8 ms 16732 KB Output is correct
36 Correct 21 ms 19928 KB Output is correct
37 Correct 135 ms 49216 KB Output is correct
38 Correct 122 ms 45160 KB Output is correct
39 Correct 121 ms 42056 KB Output is correct
40 Correct 120 ms 41280 KB Output is correct
41 Correct 118 ms 40960 KB Output is correct
42 Correct 111 ms 39244 KB Output is correct
43 Correct 134 ms 46400 KB Output is correct
44 Correct 121 ms 48192 KB Output is correct
45 Correct 116 ms 50244 KB Output is correct
46 Correct 128 ms 42440 KB Output is correct
47 Correct 30 ms 19676 KB Output is correct
48 Correct 275 ms 47904 KB Output is correct
49 Correct 270 ms 45632 KB Output is correct
50 Correct 264 ms 43868 KB Output is correct
51 Correct 251 ms 43080 KB Output is correct
52 Correct 234 ms 41028 KB Output is correct
53 Correct 185 ms 37192 KB Output is correct
54 Correct 248 ms 46816 KB Output is correct
55 Correct 238 ms 48704 KB Output is correct
56 Correct 230 ms 52800 KB Output is correct
57 Correct 233 ms 44096 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16476 KB Output is correct
2 Correct 7 ms 16476 KB Output is correct
3 Correct 8 ms 16476 KB Output is correct
4 Correct 8 ms 16476 KB Output is correct
5 Correct 8 ms 16476 KB Output is correct
6 Correct 9 ms 16700 KB Output is correct
7 Correct 8 ms 16732 KB Output is correct
8 Correct 7 ms 16592 KB Output is correct
9 Correct 8 ms 16732 KB Output is correct
10 Correct 85 ms 41480 KB Output is correct
11 Correct 115 ms 49216 KB Output is correct
12 Correct 111 ms 47780 KB Output is correct
13 Correct 123 ms 50244 KB Output is correct
14 Correct 114 ms 52844 KB Output is correct
15 Correct 99 ms 40516 KB Output is correct
16 Correct 246 ms 50408 KB Output is correct
17 Correct 246 ms 47048 KB Output is correct
18 Correct 228 ms 54624 KB Output is correct
19 Correct 242 ms 52308 KB Output is correct
20 Correct 161 ms 44072 KB Output is correct
21 Correct 160 ms 45376 KB Output is correct
22 Correct 157 ms 44612 KB Output is correct
23 Correct 168 ms 45380 KB Output is correct
24 Correct 157 ms 44872 KB Output is correct
25 Correct 158 ms 43844 KB Output is correct
26 Correct 157 ms 44872 KB Output is correct
27 Correct 151 ms 43588 KB Output is correct
28 Correct 11 ms 16732 KB Output is correct
29 Correct 9 ms 16692 KB Output is correct
30 Correct 8 ms 16728 KB Output is correct
31 Correct 8 ms 16732 KB Output is correct
32 Correct 8 ms 16732 KB Output is correct
33 Correct 8 ms 16732 KB Output is correct
34 Correct 7 ms 16732 KB Output is correct
35 Correct 8 ms 16732 KB Output is correct
36 Correct 8 ms 16732 KB Output is correct
37 Correct 21 ms 19928 KB Output is correct
38 Correct 135 ms 49216 KB Output is correct
39 Correct 122 ms 45160 KB Output is correct
40 Correct 121 ms 42056 KB Output is correct
41 Correct 120 ms 41280 KB Output is correct
42 Correct 118 ms 40960 KB Output is correct
43 Correct 111 ms 39244 KB Output is correct
44 Correct 134 ms 46400 KB Output is correct
45 Correct 121 ms 48192 KB Output is correct
46 Correct 116 ms 50244 KB Output is correct
47 Correct 128 ms 42440 KB Output is correct
48 Correct 30 ms 19676 KB Output is correct
49 Correct 275 ms 47904 KB Output is correct
50 Correct 270 ms 45632 KB Output is correct
51 Correct 264 ms 43868 KB Output is correct
52 Correct 251 ms 43080 KB Output is correct
53 Correct 234 ms 41028 KB Output is correct
54 Correct 185 ms 37192 KB Output is correct
55 Correct 248 ms 46816 KB Output is correct
56 Correct 238 ms 48704 KB Output is correct
57 Correct 230 ms 52800 KB Output is correct
58 Correct 233 ms 44096 KB Output is correct
59 Correct 86 ms 25180 KB Output is correct
60 Correct 261 ms 53600 KB Output is correct
61 Correct 244 ms 51012 KB Output is correct
62 Correct 262 ms 55364 KB Output is correct
63 Correct 251 ms 55872 KB Output is correct
64 Correct 9 ms 16788 KB Output is correct
65 Correct 9 ms 16732 KB Output is correct
66 Correct 9 ms 16624 KB Output is correct
67 Correct 10 ms 16704 KB Output is correct
68 Correct 9 ms 16732 KB Output is correct
69 Correct 10 ms 16988 KB Output is correct
70 Correct 9 ms 16784 KB Output is correct
71 Correct 9 ms 16880 KB Output is correct
72 Correct 9 ms 16776 KB Output is correct
73 Correct 10 ms 16988 KB Output is correct
74 Correct 269 ms 53024 KB Output is correct
75 Correct 128 ms 45488 KB Output is correct
76 Correct 114 ms 42816 KB Output is correct
77 Correct 146 ms 45376 KB Output is correct
78 Correct 257 ms 46920 KB Output is correct
79 Correct 212 ms 41632 KB Output is correct
80 Correct 242 ms 47812 KB Output is correct
81 Correct 292 ms 59832 KB Output is correct
82 Correct 292 ms 58564 KB Output is correct
83 Correct 384 ms 71208 KB Output is correct
84 Correct 123 ms 54304 KB Output is correct
85 Correct 315 ms 58048 KB Output is correct
86 Correct 97 ms 32460 KB Output is correct
87 Correct 250 ms 48960 KB Output is correct
88 Correct 255 ms 49516 KB Output is correct
89 Correct 228 ms 48336 KB Output is correct
90 Correct 334 ms 51784 KB Output is correct
91 Correct 356 ms 51392 KB Output is correct
92 Correct 315 ms 52420 KB Output is correct
93 Correct 408 ms 63164 KB Output is correct
94 Correct 398 ms 63172 KB Output is correct
95 Correct 481 ms 73408 KB Output is correct
96 Correct 247 ms 53836 KB Output is correct
97 Correct 315 ms 56260 KB Output is correct