oj.uz

Submission #1077899

# Submission time Handle Problem Language Result Execution time Memory
1077899 2024-08-27T10:16:03 Z GrindMachine Swapping Cities (APIO20_swap) C++17
30 / 100
 296 ms 44208 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);
 
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});
        }
    }
}
 
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]);

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

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 3 ms 6236 KB Output is correct
4 Correct 3 ms 6344 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6604 KB Output is correct
7 Correct 4 ms 6520 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 84 ms 30648 KB Output is correct
10 Correct 106 ms 37444 KB Output is correct
11 Correct 102 ms 36340 KB Output is correct
12 Correct 99 ms 38468 KB Output is correct
13 Correct 127 ms 40364 KB Output is correct
14 Correct 77 ms 30260 KB Output is correct
15 Correct 212 ms 41284 KB Output is correct
16 Correct 226 ms 38660 KB Output is correct
17 Correct 219 ms 44208 KB Output is correct
18 Correct 236 ms 42820 KB Output is correct
19 Incorrect 93 ms 15448 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 158 ms 37700 KB Output is correct
4 Correct 196 ms 39236 KB Output is correct
5 Correct 152 ms 38468 KB Output is correct
6 Correct 158 ms 38976 KB Output is correct
7 Correct 214 ms 38724 KB Output is correct
8 Correct 156 ms 37440 KB Output is correct
9 Correct 171 ms 38548 KB Output is correct
10 Correct 162 ms 37184 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 3 ms 6236 KB Output is correct
4 Correct 3 ms 6344 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6604 KB Output is correct
7 Correct 4 ms 6520 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Incorrect 4 ms 6232 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 3 ms 6236 KB Output is correct
4 Correct 3 ms 6344 KB Output is correct
5 Correct 4 ms 6492 KB Output is correct
6 Correct 5 ms 6604 KB Output is correct
7 Correct 4 ms 6520 KB Output is correct
8 Correct 4 ms 6492 KB Output is correct
9 Correct 84 ms 30648 KB Output is correct
10 Correct 106 ms 37444 KB Output is correct
11 Correct 102 ms 36340 KB Output is correct
12 Correct 99 ms 38468 KB Output is correct
13 Correct 127 ms 40364 KB Output is correct
14 Correct 77 ms 30260 KB Output is correct
15 Correct 212 ms 41284 KB Output is correct
16 Correct 226 ms 38660 KB Output is correct
17 Correct 219 ms 44208 KB Output is correct
18 Correct 236 ms 42820 KB Output is correct
19 Correct 158 ms 37700 KB Output is correct
20 Correct 196 ms 39236 KB Output is correct
21 Correct 152 ms 38468 KB Output is correct
22 Correct 158 ms 38976 KB Output is correct
23 Correct 214 ms 38724 KB Output is correct
24 Correct 156 ms 37440 KB Output is correct
25 Correct 171 ms 38548 KB Output is correct
26 Correct 162 ms 37184 KB Output is correct
27 Correct 4 ms 6492 KB Output is correct
28 Correct 5 ms 6588 KB Output is correct
29 Correct 3 ms 6492 KB Output is correct
30 Correct 3 ms 6336 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 4 ms 6492 KB Output is correct
33 Correct 3 ms 6488 KB Output is correct
34 Correct 3 ms 6492 KB Output is correct
35 Correct 3 ms 6492 KB Output is correct
36 Correct 21 ms 9948 KB Output is correct
37 Correct 106 ms 37696 KB Output is correct
38 Correct 98 ms 35144 KB Output is correct
39 Correct 97 ms 33344 KB Output is correct
40 Correct 101 ms 32580 KB Output is correct
41 Correct 105 ms 32068 KB Output is correct
42 Correct 100 ms 30528 KB Output is correct
43 Correct 143 ms 36164 KB Output is correct
44 Correct 101 ms 36932 KB Output is correct
45 Correct 94 ms 38216 KB Output is correct
46 Correct 136 ms 34372 KB Output is correct
47 Correct 23 ms 9944 KB Output is correct
48 Correct 286 ms 39852 KB Output is correct
49 Correct 263 ms 38184 KB Output is correct
50 Correct 296 ms 37192 KB Output is correct
51 Correct 271 ms 36676 KB Output is correct
52 Correct 238 ms 34692 KB Output is correct
53 Correct 179 ms 28588 KB Output is correct
54 Correct 238 ms 39212 KB Output is correct
55 Correct 267 ms 40256 KB Output is correct
56 Correct 219 ms 42796 KB Output is correct
57 Correct 223 ms 38356 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6232 KB Output isn't correct
2 Halted 0 ms 0 KB -