oj.uz

답안 #792857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792857 2023-07-25T09:59:55 Z bachhoangxuan 도로 개발 (JOI15_road_development) C++17
100 / 100
 252 ms 46632 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
vector<pii> e;
namespace Tree{
    vector<vector<int>> edge,Min;
    vector<int> lg2,dep,L,R;
    int pos;
    int cmp(int u,int v){
        return (dep[u]<dep[v]?u:v);
    }
    int lca(int u,int v){
        u=L[u];v=L[v];
        if(u>v) swap(u,v);
        int p=lg2[v-u+1];
        return cmp(Min[u][p],Min[v-(1<<p)+1][p]);
    }
    int dist(int u,int v){
        return dep[u]+dep[v]-2*dep[lca(u,v)];
    }
    void dfs(int u,int p){
        L[u]=++pos;Min[pos][0]=u;
        dep[u]=dep[p]+1;
        for(int v:edge[u]){
            if(v==p) continue;
            dfs(v,u);Min[++pos][0]=u;
        }
        R[u]=pos;
    }
    void init(int n){
        lg2.assign(2*n+1,0);
        dep.assign(n+1,0);
        L.assign(n+1,0);
        R.assign(n+1,0);
        edge.resize(n+1);
        Min.assign(2*n+1,vector<int>(maxl,0));
    }
    void build(int n){
        init(n);
        for(int i=0;i<(int)e.size();i++){
            int u=e[i].fi,v=e[i].se;//cin >> u >> v;
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        for(int i=1;i<=n;i++){
            if(!L[i]) dfs(i,0);
        }
        for(int i=2;i<=pos;i++) lg2[i]=lg2[i/2]+1;
        for(int i=1;i<20;i++){
            for(int j=1;j<=(pos-(1<<i)+1);j++) Min[j][i]=cmp(Min[j][i-1],Min[j+(1<<(i-1))][i-1]);
        }
    }
}
namespace BIT{
    vector<int> bit;
    int n;
    void init(int N){
        n=N;
        bit.assign(N+1,0);
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    }
    void update(int x,int val){
        for(int i=x;i<=n;i+=(i&(-i))) bit[i]+=val;
    }
    void update_range(int l,int r,int val){
        update(l,val);update(r+1,-val);
    }
}
void solve(){
    int n,q;cin >> n >> q;
    vector<int> par(n+1,0),cc(n+1,0),d(n+1,0);
    for(int i=1;i<=n;i++) par[i]=i;
    vector<piii> f(q);
    function<int(int)> findpar = [&](int u){
        if(u!=par[u]) return par[u]=findpar(par[u]);
        return u;
    };
    function<int(int)> findcc = [&](int u){
        if(u!=cc[u]) return cc[u]=findcc(cc[u]);
        return u;
    };
    auto unions = [&](int u,int v){
        u=findpar(u);v=findpar(v);
        if(u==v) return false;
        return par[v]=u,true;
    };
    for(int i=0;i<q;i++){
        int id,u,v;cin >> id >> u >> v;f[i]={id,{u,v}};
        if(id==1 && unions(u,v)){
            e.push_back({u,v});
            //cout << u << ' ' << v << '\n';
        }
    }
    for(int i=1;i<=n;i++) par[i]=cc[i]=i;
    Tree::build(n);
    BIT::init(2*n);
    for(auto [id,p]:f){
        int u=p.fi,v=p.se;
        if(id==1){
            if(findpar(u)!=findpar(v)){
                if(Tree::L[u]>Tree::L[v]) swap(u,v);
                BIT::update_range(Tree::L[v],Tree::R[v],1);d[v]=par[v]=u;
            }
            else{
                int a=Tree::lca(u,v);
                for(int t=0;t<2;t++){
                    while(true){
                        int pu=findcc(u);
                        if(Tree::L[pu]<=Tree::L[a]) break;
                        BIT::update_range(Tree::L[pu],Tree::R[pu],-1);
                        u=cc[pu]=d[pu];
                    }
                    swap(u,v);
                }
            }
        }
        else{
            //cout << u << ' ' << v << ' ' << Tree::lca(u,v) << '\n';
            if(findpar(u)!=findpar(v)) cout << -1 << '\n';
            else cout << BIT::query(Tree::L[u])+BIT::query(Tree::L[v])-2*BIT::query(Tree::L[Tree::lca(u,v)]) << '\n';
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message

road_development.cpp:31:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   31 | const int inf=1e18;
      |               ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 676 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 179 ms 42176 KB Output is correct
2 Correct 201 ms 41872 KB Output is correct
3 Correct 191 ms 45064 KB Output is correct
4 Correct 187 ms 45256 KB Output is correct
5 Correct 196 ms 44104 KB Output is correct
6 Correct 205 ms 43856 KB Output is correct
7 Correct 194 ms 41856 KB Output is correct
8 Correct 182 ms 43912 KB Output is correct
9 Correct 175 ms 41416 KB Output is correct
10 Correct 179 ms 42976 KB Output is correct
11 Correct 190 ms 44608 KB Output is correct
12 Correct 223 ms 46240 KB Output is correct
13 Correct 179 ms 46632 KB Output is correct
14 Correct 203 ms 44372 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 252 ms 42108 KB Output is correct
2 Correct 196 ms 41864 KB Output is correct
3 Correct 222 ms 44492 KB Output is correct
4 Correct 228 ms 45536 KB Output is correct
5 Correct 219 ms 41868 KB Output is correct
6 Correct 233 ms 44612 KB Output is correct
7 Correct 171 ms 42008 KB Output is correct
8 Correct 240 ms 43776 KB Output is correct
9 Correct 219 ms 43916 KB Output is correct
10 Correct 206 ms 45092 KB Output is correct
11 Correct 173 ms 41788 KB Output is correct
12 Correct 223 ms 45204 KB Output is correct
13 Correct 197 ms 45512 KB Output is correct
14 Correct 194 ms 44504 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 39276 KB Output is correct
2 Correct 176 ms 39036 KB Output is correct
3 Correct 180 ms 41344 KB Output is correct
4 Correct 169 ms 42308 KB Output is correct
5 Correct 214 ms 41308 KB Output is correct
6 Correct 231 ms 44756 KB Output is correct
7 Correct 102 ms 36648 KB Output is correct
8 Correct 107 ms 39232 KB Output is correct
9 Correct 141 ms 40832 KB Output is correct
10 Correct 171 ms 39472 KB Output is correct
11 Correct 182 ms 42852 KB Output is correct
12 Correct 223 ms 43672 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 676 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 ms 720 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 179 ms 42176 KB Output is correct
10 Correct 201 ms 41872 KB Output is correct
11 Correct 191 ms 45064 KB Output is correct
12 Correct 187 ms 45256 KB Output is correct
13 Correct 196 ms 44104 KB Output is correct
14 Correct 205 ms 43856 KB Output is correct
15 Correct 194 ms 41856 KB Output is correct
16 Correct 182 ms 43912 KB Output is correct
17 Correct 175 ms 41416 KB Output is correct
18 Correct 179 ms 42976 KB Output is correct
19 Correct 190 ms 44608 KB Output is correct
20 Correct 223 ms 46240 KB Output is correct
21 Correct 179 ms 46632 KB Output is correct
22 Correct 203 ms 44372 KB Output is correct
23 Correct 252 ms 42108 KB Output is correct
24 Correct 196 ms 41864 KB Output is correct
25 Correct 222 ms 44492 KB Output is correct
26 Correct 228 ms 45536 KB Output is correct
27 Correct 219 ms 41868 KB Output is correct
28 Correct 233 ms 44612 KB Output is correct
29 Correct 171 ms 42008 KB Output is correct
30 Correct 240 ms 43776 KB Output is correct
31 Correct 219 ms 43916 KB Output is correct
32 Correct 206 ms 45092 KB Output is correct
33 Correct 173 ms 41788 KB Output is correct
34 Correct 223 ms 45204 KB Output is correct
35 Correct 197 ms 45512 KB Output is correct
36 Correct 194 ms 44504 KB Output is correct
37 Correct 171 ms 39276 KB Output is correct
38 Correct 176 ms 39036 KB Output is correct
39 Correct 180 ms 41344 KB Output is correct
40 Correct 169 ms 42308 KB Output is correct
41 Correct 214 ms 41308 KB Output is correct
42 Correct 231 ms 44756 KB Output is correct
43 Correct 102 ms 36648 KB Output is correct
44 Correct 107 ms 39232 KB Output is correct
45 Correct 141 ms 40832 KB Output is correct
46 Correct 171 ms 39472 KB Output is correct
47 Correct 182 ms 42852 KB Output is correct
48 Correct 223 ms 43672 KB Output is correct
49 Correct 221 ms 42220 KB Output is correct
50 Correct 217 ms 41900 KB Output is correct
51 Correct 237 ms 44976 KB Output is correct
52 Correct 252 ms 46268 KB Output is correct
53 Correct 199 ms 40996 KB Output is correct
54 Correct 164 ms 41064 KB Output is correct
55 Correct 224 ms 43684 KB Output is correct
56 Correct 196 ms 44656 KB Output is correct
57 Correct 206 ms 43836 KB Output is correct
58 Correct 213 ms 43728 KB Output is correct
59 Correct 198 ms 43668 KB Output is correct
60 Correct 188 ms 44052 KB Output is correct
61 Correct 219 ms 44580 KB Output is correct