답안 #551113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551113	2022-04-19T22:16:28 Z	inksamurai	Reconstruction Project (JOI22_reconstruction)	C++17	0 / 100	5000 ms	6720 KB

reconstruction

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3xxEYjy ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

struct dsu{
	int n,cmps;
	vector<int> par,siz;
	dsu(int m){init(m);}
	void init(int m){
		n=m;
		cmps=m;
		par.resize(n,0);
		siz.resize(n,0);
		for(int i=0;i<n;i++){
			par[i]=i;
			siz[i]=1;
		}
	}
	void merge(int v,int u){
		v=parent(v),u=parent(u);
		if(v==u)return;
		cmps--;
		if(siz[v]<siz[u])swap(v,u);
		siz[v]+=siz[u];
		par[u]=v;
	}
	int parent(int v){
		return par[v]==v?v:parent(par[v]);
	}
	bool same(int v, int u){
		return parent(v)==parent(u);
	}
	int size(int v=-1){
		return (v==-1?cmps:siz[parent(v)]);
	}
};

signed main(){
_3xxEYjy;
	int n,m;
	cin>>n>>m;
	using fpii=pair<pii,pii>;
	vec(fpii) edges;
	rep(i,m){
		int u,v,w;
		cin>>u>>v>>w;
		u-=1,v-=1;
		edges.pb({{w,i},{u,v}});
	}
	int q;
	cin>>q;
	vi qry;
	rep(i,q){
		int x;
		cin>>x;
		qry.pb(x);
	}

	dsu uf(0);
	vi usd(m,0);
	vi now;
	vi ids;
	vi psum;
	auto mst=[&](int x,int t=0)->bool{
		sort(edges.begin(),edges.end(),[&](fpii l,fpii r){
			return abs(l.fi.fi-x)<abs(r.fi.fi-x);
		});
		uf.init(n);
		for(auto e:edges){
			if(uf.same(e.se.fi,e.se.se)) continue;
			if(!t){
				if(usd[e.fi.se]==0){
					return 0;
				}
			}else{
				usd[e.fi.se]=1;
				ids.pb(e.fi.se);
				now.pb(e.fi.fi);
			}
			uf.merge(e.se.fi,e.se.se);
		}
		if(t){
			sort(now.begin(),now.end());
			for(auto w:now){
				psum.pb((sz(psum)?psum.back():0)+w);
			}
		}
		return 1;
	};

	auto eval=[&](int x){
		int j=prev(upper_bound(now.begin(),now.end(),x))-now.begin();
		int sugim=0;
		if(j>=0){
			sugim+=(j+1)*x-psum[j];
		}
		if(j+1<sz(psum)){
			sugim+=(psum.back()-(j<0?0:psum[j])-(sz(psum)-j-1)*x);
		}
		return sugim;
	};

	vi pns;
	int here=0;
	rep(i,q){
		if(!i){
			mst(qry[i],1);
			pns.pb(eval(qry[i]));
		}else{
			here+=1;
			for(auto j:ids){
				usd[j]=0;
			}
			ids.clear();
			now.clear();
			psum.clear();
			mst(qry[i],1);
			int l=i,r=q-1,c=i;
			while(l<=r){
				int m=(l+r)>>1;
				if(mst(qry[m])){
					c=m;
					l=m+1;
				}else{
					r=m-1;
				}
			}
			for(int j=i;j<=c;j++){
				pns.pb(eval(qry[j]));
			}
			i=c;
		}
	}
	assert(here<=2*m);
	rep(i,q){
		cout<<pns[i]<<"\n";
	}
//	
	return 0;
}

Subtask #1
0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Incorrect	1 ms	212 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Incorrect	1 ms	212 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Execution timed out	5013 ms	6720 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-