제출 #568817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568817		zaneyu	Reconstruction Project (JOI22_reconstruction)	C++14	31 / 100	5055 ms	25044 KiB

reconstruction

/*input
3 4
1 2 1
1 2 4
2 3 2
2 3 4
4
1
2
3
4
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int par[maxn];
int find(int u){
    if(par[u]==u) return u;
    return par[u]=find(par[u]);
}
void merge(int a,int b){
    a=find(a),b=find(b);
    if(a==b) return;
    par[a]=b;
}
vector<int> vv[maxn];
bool flp[maxn];
int cur[maxn];
vector<pair<int,pii>> ed;
int n;
bool wk(int mid,pair<int,pii> cur){
    REP(i,n) par[i]=i;
    for(auto x:ed){
        if(make_pair(abs(x.f-mid),x)<make_pair(abs(cur.f-mid),cur)){
            merge(x.s.f,x.s.s);
        }
    }
    int a=cur.s.f,b=cur.s.s;
    if(find(a)!=find(b)) return true;
    return false;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int m;
    cin>>n>>m;
    REP(i,m){
        int a,b,c;
        cin>>a>>b>>c;
        --a,--b;
        ed.pb({c,{a,b}});
    }
    sort(ALL(ed));
    vector<pair<int,pii>> turn;
    for(auto x:ed){
        int l=1,r=x.f;
        while(l<r){
            int mid=(l+r)/2;
            if(wk(mid,x)) r=mid;
            else l=mid+1;
        }
        int L=l;
        l=x.f,r=1e9;
        while(l<r){
            int mid=(l+r+1)/2;
            if(wk(mid,x)) l=mid;
            else r=mid-1;
        }
        turn.pb({L,{-1,x.f}});
        turn.pb({x.f,{2,-2*x.f}});
        turn.pb({r+1,{-1,x.f}});
        //cout<<L<<' '<<r<<'\n';
    }
    sort(ALL(turn));
    int q;
    cin>>q;
    ll co=0,s=0;
    int p=0;
    while(q--){
        int k;
        cin>>k;
        while(p<sz(turn) and turn[p].f<=k){
            co+=turn[p].s.f;
            s+=turn[p].s.s;
            ++p;
        }
        cout<<s+co*k<<'\n';
    }
} 

• Subtask 1: 3 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 28 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23