oj.uz

답안 #551408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551408 2022-04-20T15:16:21 Z inksamurai Reconstruction Project (JOI22_reconstruction) C++17
31 / 100
 5000 ms 17344 KB 
#include <bits/stdc++.h>
#define int ll
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 tpii=pair<int,pii>;
	vec(tpii) edges;
	rep(i,m){
		int u,v,w;
		cin>>u>>v>>w;
		u-=1,v-=1;
		edges.pb({w,{u,v}});
	}
	sort(edges.begin(),edges.end());

	const int inf=1e17;
	vec(tpii) evts;
	rep(i,m){
		dsu uf(n);
		int r=inf;
		rng(j,i+1,m){
			uf.merge(edges[j].se.fi,edges[j].se.se);
			if(uf.same(edges[i].se.fi,edges[i].se.se)){
				r=edges[j].fi;
				break;
			}
		}
		uf.init(n);
		int l=-inf;
		per(j,i){
			uf.merge(edges[j].se.fi,edges[j].se.se);
			if(uf.same(edges[i].se.fi,edges[i].se.se)){
				l=edges[j].fi;
				break;
			}
		}
		evts.pb({(l+edges[i].fi)/2+(l+edges[i].fi)%2,{1,i}});
		evts.pb({(r+edges[i].fi)/2+((r+edges[i].fi)%2),{-1,i}});
	}
	sort(evts.begin(),evts.end());

	// for(auto tp:evts){
	// 	print(tp.fi,tp.se.fi,edges[tp.se.se].fi);
	// }

	int q;
	cin>>q;
	int i=-1;
	set<int> st;
	rep(_,q){
		int x;
		cin>>x;
		while(i+1<sz(evts) and evts[i+1].fi<=x){
			i+=1;
			if(evts[i].se.fi==1){
				st.insert(evts[i].se.se);
			}else{
				st.erase(evts[i].se.se);
			}
		}
		dsu uf(n);
		int res=0;
		for(auto id:st){
			// print(edges[id].fi);
			res+=abs(edges[id].fi-x);
		}
		assert(sz(st)==n-1);
		print(res);
		// break;
	}
//	
	return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2005 ms 9060 KB Output is correct
21 Correct 1309 ms 8900 KB Output is correct
22 Correct 1402 ms 8884 KB Output is correct
23 Correct 1556 ms 9052 KB Output is correct
24 Correct 1989 ms 8884 KB Output is correct
25 Correct 2037 ms 8884 KB Output is correct
26 Correct 2003 ms 9036 KB Output is correct
27 Correct 2004 ms 9052 KB Output is correct
28 Correct 1982 ms 9164 KB Output is correct
29 Runtime error 836 ms 15808 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 4090 ms 13752 KB Output is correct
21 Correct 4046 ms 13844 KB Output is correct
22 Correct 4106 ms 13668 KB Output is correct
23 Correct 3985 ms 13720 KB Output is correct
24 Correct 4042 ms 13676 KB Output is correct
25 Correct 3993 ms 13744 KB Output is correct
26 Correct 3961 ms 13668 KB Output is correct
27 Correct 4003 ms 13660 KB Output is correct
28 Correct 3961 ms 13692 KB Output is correct
29 Correct 3981 ms 13640 KB Output is correct
30 Correct 4103 ms 13740 KB Output is correct
31 Correct 3890 ms 13648 KB Output is correct
32 Correct 3726 ms 14408 KB Output is correct
33 Correct 4008 ms 13420 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2005 ms 9060 KB Output is correct
21 Correct 1309 ms 8900 KB Output is correct
22 Correct 1402 ms 8884 KB Output is correct
23 Correct 1556 ms 9052 KB Output is correct
24 Correct 1989 ms 8884 KB Output is correct
25 Correct 2037 ms 8884 KB Output is correct
26 Correct 2003 ms 9036 KB Output is correct
27 Correct 2004 ms 9052 KB Output is correct
28 Correct 1982 ms 9164 KB Output is correct
29 Runtime error 836 ms 15808 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2005 ms 9060 KB Output is correct
21 Correct 1309 ms 8900 KB Output is correct
22 Correct 1402 ms 8884 KB Output is correct
23 Correct 1556 ms 9052 KB Output is correct
24 Correct 1989 ms 8884 KB Output is correct
25 Correct 2037 ms 8884 KB Output is correct
26 Correct 2003 ms 9036 KB Output is correct
27 Correct 2004 ms 9052 KB Output is correct
28 Correct 1982 ms 9164 KB Output is correct
29 Runtime error 836 ms 15808 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -