oj.uz

답안 #1077916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077916 2024-08-27T10:29:47 Z GrindMachine 자매 도시 (APIO20_swap) C++17
53 / 100
 2000 ms 44616 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);

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);
        while(u != lca){
            amin(smallest_cyc[u],w);
            u = up[u][0];
        }
        while(v != lca){
            amin(smallest_cyc[v],w);
            v = up[v][0];
        }
        amin(smallest_cyc[lca],w);    
    }
}
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6580 KB Output is correct
4 Correct 4 ms 6744 KB Output is correct
5 Correct 5 ms 7000 KB Output is correct
6 Correct 3 ms 7004 KB Output is correct
7 Correct 5 ms 6948 KB Output is correct
8 Correct 3 ms 7004 KB Output is correct
9 Correct 81 ms 31028 KB Output is correct
10 Correct 88 ms 37960 KB Output is correct
11 Correct 87 ms 36932 KB Output is correct
12 Correct 125 ms 38984 KB Output is correct
13 Correct 92 ms 40776 KB Output is correct
14 Correct 104 ms 30812 KB Output is correct
15 Correct 231 ms 41480 KB Output is correct
16 Correct 217 ms 39280 KB Output is correct
17 Correct 208 ms 44608 KB Output is correct
18 Correct 214 ms 43060 KB Output is correct
19 Correct 82 ms 16608 KB Output is correct
20 Correct 220 ms 41168 KB Output is correct
21 Correct 226 ms 38980 KB Output is correct
22 Correct 234 ms 42308 KB Output is correct
23 Correct 228 ms 42584 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 178 ms 38212 KB Output is correct
4 Correct 153 ms 39492 KB Output is correct
5 Correct 156 ms 38668 KB Output is correct
6 Correct 151 ms 39488 KB Output is correct
7 Correct 160 ms 39236 KB Output is correct
8 Correct 168 ms 37972 KB Output is correct
9 Correct 157 ms 38976 KB Output is correct
10 Correct 160 ms 37700 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6580 KB Output is correct
4 Correct 4 ms 6744 KB Output is correct
5 Correct 5 ms 7000 KB Output is correct
6 Correct 3 ms 7004 KB Output is correct
7 Correct 5 ms 6948 KB Output is correct
8 Correct 3 ms 7004 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 4 ms 6992 KB Output is correct
11 Correct 4 ms 7004 KB Output is correct
12 Correct 3 ms 6744 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 3 ms 7000 KB Output is correct
16 Correct 4 ms 7004 KB Output is correct
17 Correct 3 ms 7004 KB Output is correct
18 Correct 4 ms 7004 KB Output is correct
19 Correct 4 ms 6736 KB Output is correct
20 Correct 4 ms 7000 KB Output is correct
21 Correct 3 ms 6744 KB Output is correct
22 Correct 6 ms 7004 KB Output is correct
23 Correct 4 ms 6748 KB Output is correct
24 Correct 5 ms 7004 KB Output is correct
25 Correct 4 ms 7004 KB Output is correct
26 Correct 7 ms 6948 KB Output is correct
27 Correct 3 ms 7004 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 4 ms 6492 KB Output is correct
4 Correct 5 ms 6580 KB Output is correct
5 Correct 4 ms 6744 KB Output is correct
6 Correct 5 ms 7000 KB Output is correct
7 Correct 3 ms 7004 KB Output is correct
8 Correct 5 ms 6948 KB Output is correct
9 Correct 3 ms 7004 KB Output is correct
10 Correct 81 ms 31028 KB Output is correct
11 Correct 88 ms 37960 KB Output is correct
12 Correct 87 ms 36932 KB Output is correct
13 Correct 125 ms 38984 KB Output is correct
14 Correct 92 ms 40776 KB Output is correct
15 Correct 4 ms 6992 KB Output is correct
16 Correct 4 ms 7004 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 7000 KB Output is correct
21 Correct 4 ms 7004 KB Output is correct
22 Correct 3 ms 7004 KB Output is correct
23 Correct 4 ms 7004 KB Output is correct
24 Correct 4 ms 6736 KB Output is correct
25 Correct 4 ms 7000 KB Output is correct
26 Correct 3 ms 6744 KB Output is correct
27 Correct 6 ms 7004 KB Output is correct
28 Correct 4 ms 6748 KB Output is correct
29 Correct 5 ms 7004 KB Output is correct
30 Correct 4 ms 7004 KB Output is correct
31 Correct 7 ms 6948 KB Output is correct
32 Correct 3 ms 7004 KB Output is correct
33 Correct 4 ms 7004 KB Output is correct
34 Correct 17 ms 10460 KB Output is correct
35 Correct 102 ms 38204 KB Output is correct
36 Correct 108 ms 35648 KB Output is correct
37 Correct 99 ms 33604 KB Output is correct
38 Correct 95 ms 32852 KB Output is correct
39 Correct 93 ms 32576 KB Output is correct
40 Correct 94 ms 31040 KB Output is correct
41 Correct 96 ms 36416 KB Output is correct
42 Correct 101 ms 37368 KB Output is correct
43 Correct 94 ms 38632 KB Output is correct
44 Correct 104 ms 34884 KB Output is correct
45 Correct 274 ms 37912 KB Output is correct
46 Correct 110 ms 34624 KB Output is correct
47 Correct 108 ms 32836 KB Output is correct
48 Correct 121 ms 34160 KB Output is correct
49 Correct 132 ms 27996 KB Output is correct
50 Correct 122 ms 22436 KB Output is correct
51 Correct 194 ms 33132 KB Output is correct
52 Execution timed out 2052 ms 44616 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6492 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 5 ms 6580 KB Output is correct
4 Correct 4 ms 6744 KB Output is correct
5 Correct 5 ms 7000 KB Output is correct
6 Correct 3 ms 7004 KB Output is correct
7 Correct 5 ms 6948 KB Output is correct
8 Correct 3 ms 7004 KB Output is correct
9 Correct 81 ms 31028 KB Output is correct
10 Correct 88 ms 37960 KB Output is correct
11 Correct 87 ms 36932 KB Output is correct
12 Correct 125 ms 38984 KB Output is correct
13 Correct 92 ms 40776 KB Output is correct
14 Correct 104 ms 30812 KB Output is correct
15 Correct 231 ms 41480 KB Output is correct
16 Correct 217 ms 39280 KB Output is correct
17 Correct 208 ms 44608 KB Output is correct
18 Correct 214 ms 43060 KB Output is correct
19 Correct 178 ms 38212 KB Output is correct
20 Correct 153 ms 39492 KB Output is correct
21 Correct 156 ms 38668 KB Output is correct
22 Correct 151 ms 39488 KB Output is correct
23 Correct 160 ms 39236 KB Output is correct
24 Correct 168 ms 37972 KB Output is correct
25 Correct 157 ms 38976 KB Output is correct
26 Correct 160 ms 37700 KB Output is correct
27 Correct 4 ms 6992 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct
29 Correct 3 ms 6744 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 4 ms 6748 KB Output is correct
32 Correct 3 ms 7000 KB Output is correct
33 Correct 4 ms 7004 KB Output is correct
34 Correct 3 ms 7004 KB Output is correct
35 Correct 4 ms 7004 KB Output is correct
36 Correct 17 ms 10460 KB Output is correct
37 Correct 102 ms 38204 KB Output is correct
38 Correct 108 ms 35648 KB Output is correct
39 Correct 99 ms 33604 KB Output is correct
40 Correct 95 ms 32852 KB Output is correct
41 Correct 93 ms 32576 KB Output is correct
42 Correct 94 ms 31040 KB Output is correct
43 Correct 96 ms 36416 KB Output is correct
44 Correct 101 ms 37368 KB Output is correct
45 Correct 94 ms 38632 KB Output is correct
46 Correct 104 ms 34884 KB Output is correct
47 Correct 24 ms 10460 KB Output is correct
48 Correct 249 ms 40008 KB Output is correct
49 Correct 238 ms 38576 KB Output is correct
50 Correct 227 ms 37444 KB Output is correct
51 Correct 239 ms 36924 KB Output is correct
52 Correct 242 ms 35140 KB Output is correct
53 Correct 171 ms 28996 KB Output is correct
54 Correct 271 ms 39760 KB Output is correct
55 Correct 250 ms 40772 KB Output is correct
56 Correct 235 ms 43228 KB Output is correct
57 Correct 235 ms 38720 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 4 ms 6492 KB Output is correct
4 Correct 5 ms 6580 KB Output is correct
5 Correct 4 ms 6744 KB Output is correct
6 Correct 5 ms 7000 KB Output is correct
7 Correct 3 ms 7004 KB Output is correct
8 Correct 5 ms 6948 KB Output is correct
9 Correct 3 ms 7004 KB Output is correct
10 Correct 81 ms 31028 KB Output is correct
11 Correct 88 ms 37960 KB Output is correct
12 Correct 87 ms 36932 KB Output is correct
13 Correct 125 ms 38984 KB Output is correct
14 Correct 92 ms 40776 KB Output is correct
15 Correct 104 ms 30812 KB Output is correct
16 Correct 231 ms 41480 KB Output is correct
17 Correct 217 ms 39280 KB Output is correct
18 Correct 208 ms 44608 KB Output is correct
19 Correct 214 ms 43060 KB Output is correct
20 Correct 178 ms 38212 KB Output is correct
21 Correct 153 ms 39492 KB Output is correct
22 Correct 156 ms 38668 KB Output is correct
23 Correct 151 ms 39488 KB Output is correct
24 Correct 160 ms 39236 KB Output is correct
25 Correct 168 ms 37972 KB Output is correct
26 Correct 157 ms 38976 KB Output is correct
27 Correct 160 ms 37700 KB Output is correct
28 Correct 4 ms 6992 KB Output is correct
29 Correct 4 ms 7004 KB Output is correct
30 Correct 3 ms 6744 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 4 ms 6748 KB Output is correct
33 Correct 3 ms 7000 KB Output is correct
34 Correct 4 ms 7004 KB Output is correct
35 Correct 3 ms 7004 KB Output is correct
36 Correct 4 ms 7004 KB Output is correct
37 Correct 17 ms 10460 KB Output is correct
38 Correct 102 ms 38204 KB Output is correct
39 Correct 108 ms 35648 KB Output is correct
40 Correct 99 ms 33604 KB Output is correct
41 Correct 95 ms 32852 KB Output is correct
42 Correct 93 ms 32576 KB Output is correct
43 Correct 94 ms 31040 KB Output is correct
44 Correct 96 ms 36416 KB Output is correct
45 Correct 101 ms 37368 KB Output is correct
46 Correct 94 ms 38632 KB Output is correct
47 Correct 104 ms 34884 KB Output is correct
48 Correct 24 ms 10460 KB Output is correct
49 Correct 249 ms 40008 KB Output is correct
50 Correct 238 ms 38576 KB Output is correct
51 Correct 227 ms 37444 KB Output is correct
52 Correct 239 ms 36924 KB Output is correct
53 Correct 242 ms 35140 KB Output is correct
54 Correct 171 ms 28996 KB Output is correct
55 Correct 271 ms 39760 KB Output is correct
56 Correct 250 ms 40772 KB Output is correct
57 Correct 235 ms 43228 KB Output is correct
58 Correct 235 ms 38720 KB Output is correct
59 Correct 82 ms 16608 KB Output is correct
60 Correct 220 ms 41168 KB Output is correct
61 Correct 226 ms 38980 KB Output is correct
62 Correct 234 ms 42308 KB Output is correct
63 Correct 228 ms 42584 KB Output is correct
64 Correct 4 ms 6736 KB Output is correct
65 Correct 4 ms 7000 KB Output is correct
66 Correct 3 ms 6744 KB Output is correct
67 Correct 6 ms 7004 KB Output is correct
68 Correct 4 ms 6748 KB Output is correct
69 Correct 5 ms 7004 KB Output is correct
70 Correct 4 ms 7004 KB Output is correct
71 Correct 7 ms 6948 KB Output is correct
72 Correct 3 ms 7004 KB Output is correct
73 Correct 4 ms 7004 KB Output is correct
74 Correct 274 ms 37912 KB Output is correct
75 Correct 110 ms 34624 KB Output is correct
76 Correct 108 ms 32836 KB Output is correct
77 Correct 121 ms 34160 KB Output is correct
78 Correct 132 ms 27996 KB Output is correct
79 Correct 122 ms 22436 KB Output is correct
80 Correct 194 ms 33132 KB Output is correct
81 Execution timed out 2052 ms 44616 KB Time limit exceeded
82 Halted 0 ms 0 KB -