oj.uz

답안 #1020765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020765 2024-07-12T09:33:22 Z Unforgettablepl Reconstruction Project (JOI22_reconstruction) C++17
7 / 100
 5000 ms 6876 KB 
#pragma GCC optimize("Ofast","unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int INF = 1e15;

struct UFDS{
	vector<int> p,siz;
	UFDS(int n):p(n+1),siz(n+1,1){iota(p.begin(),p.end(),0);}
	int findRoot(int x){
		return p[x]==x ? x : p[x]=findRoot(p[x]);
	}
	bool unite(int a,int b){
		a = findRoot(a);
		b = findRoot(b);
		if(a==b)return false;
		if(siz[a]<siz[b])swap(a,b);
		siz[a]+=siz[b];
		p[b]=a;
		return true;
	}
};

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n,m;
	cin >> n >> m;
	vector<pair<int,pair<int,int>>> edges(m);
	for(auto&[a,b]:edges)cin>>b.first>>b.second>>a;
	// sort(edges.begin(),edges.end());
	// vector<set<pair<int,int>>> adj;
	// vector<int> replaces_front(m,-1);
	// {
	// 	// Calculation from the front
	// 	adj = vector<set<pair<int,int>>>(n+1);
	// 	int tar;
	// 	function<pair<bool,int>(int,int)> dfs = [&](int x,int p){
	// 		if(x==tar)return make_pair(true,(int)1e15);
	// 		for(auto[v,i]:adj[x])if(v!=p){
	// 			auto res = dfs(v,x);
	// 			if(res.first)return make_pair(true,min(res.second,i));
	// 		}
	// 		return make_pair(false,(int)0);
	// 	};
	// 	for(int i=0;i<m;i++){
	// 		tar = edges[i].second.second;
	// 		auto res = dfs(edges[i].second.first,-1);
	// 		if(res.first){
	// 			adj[edges[res.second].second.first].erase({edges[res.second].second.second,res.second});
	// 			adj[edges[res.second].second.second].erase({edges[res.second].second.first,res.second});
	// 			replaces_front[i] = res.second;
	// 		}
	// 		adj[edges[i].second.first].insert({edges[i].second.second,i});
	// 		adj[edges[i].second.second].insert({edges[i].second.first,i});
	// 	}
	// }
	// vector<int> replaces_back(m,-1);
	// {
	// 	// Calculation from the back
	// 	adj = vector<set<pair<int,int>>>(n+1);
	// 	int tar;
	// 	function<pair<bool,int>(int,int)> dfs = [&](int x,int p){
	// 		if(x==tar)return make_pair(true,(int)-1);
	// 		for(auto[v,i]:adj[x])if(v!=p){
	// 			auto res = dfs(v,x);
	// 			if(res.first)return make_pair(true,max(res.second,i));
	// 		}
	// 		return make_pair(false,(int)0);
	// 	};
	// 	for(int i=m-1;i>=0;i--){
	// 		tar = edges[i].second.second;
	// 		auto res = dfs(edges[i].second.first,-1);
	// 		if(res.first){
	// 			adj[edges[res.second].second.first].erase({edges[res.second].second.second,res.second});
	// 			adj[edges[res.second].second.second].erase({edges[res.second].second.first,res.second});
	// 			replaces_back[i] = res.second;
	// 		}
	// 		adj[edges[i].second.first].insert({edges[i].second.second,i});
	// 		adj[edges[i].second.second].insert({edges[i].second.first,i});
	// 	}
	// }
	// set<int> curr_left;
	// set<int> curr_right;
	// for(auto&i:adj)for(auto[a,b]:i)curr_right.insert(b);
	auto solve = [&](int x){
		vector<pair<int,int>> curredges;
		for(int i=0;i<m;i++){
			curredges.emplace_back(abs(edges[i].first-x),i);
		}
		sort(curredges.begin(),curredges.end());
		int ans = 0;
		UFDS dsu(n);
		for(auto[c,i]:curredges){
			if(dsu.unite(edges[i].second.first,edges[i].second.second))ans+=c;
		}
		return ans;
	};
	// int iter = 0;
	int q;
	cin >> q;
	for(int i=1;i<=q;i++){
		int query;
		cin >> query;
		// while(iter!=m and edges[iter].first<query){
		// 	curr_right.erase(iter);
		// 	if(replaces_back[iter]!=-1){
		// 		curr_right.insert(replaces_back[iter]);
		// 	}
		// 	curr_left.insert(iter);
		// 	if(replaces_front[iter]!=-1){
		// 		curr_left.erase(replaces_front[iter]);
		// 	}
		// 	iter++;
		// }
		cout << solve(query) << '\n';
	}
}

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 98 ms 6440 KB Output is correct
21 Correct 96 ms 6876 KB Output is correct
22 Correct 98 ms 6416 KB Output is correct
23 Correct 97 ms 6440 KB Output is correct
24 Correct 96 ms 6428 KB Output is correct
25 Correct 106 ms 6420 KB Output is correct
26 Correct 97 ms 6416 KB Output is correct
27 Correct 96 ms 6828 KB Output is correct
28 Correct 122 ms 6428 KB Output is correct
29 Correct 108 ms 6416 KB Output is correct
30 Correct 96 ms 6432 KB Output is correct
31 Correct 95 ms 6440 KB Output is correct
32 Correct 100 ms 6420 KB Output is correct
33 Correct 97 ms 6420 KB Output is correct
34 Correct 70 ms 6420 KB Output is correct
35 Correct 97 ms 6416 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Execution timed out 5089 ms 3924 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 98 ms 6440 KB Output is correct
21 Correct 96 ms 6876 KB Output is correct
22 Correct 98 ms 6416 KB Output is correct
23 Correct 97 ms 6440 KB Output is correct
24 Correct 96 ms 6428 KB Output is correct
25 Correct 106 ms 6420 KB Output is correct
26 Correct 97 ms 6416 KB Output is correct
27 Correct 96 ms 6828 KB Output is correct
28 Correct 122 ms 6428 KB Output is correct
29 Correct 108 ms 6416 KB Output is correct
30 Correct 96 ms 6432 KB Output is correct
31 Correct 95 ms 6440 KB Output is correct
32 Correct 100 ms 6420 KB Output is correct
33 Correct 97 ms 6420 KB Output is correct
34 Correct 70 ms 6420 KB Output is correct
35 Correct 97 ms 6416 KB Output is correct
36 Execution timed out 5055 ms 6468 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 98 ms 6440 KB Output is correct
21 Correct 96 ms 6876 KB Output is correct
22 Correct 98 ms 6416 KB Output is correct
23 Correct 97 ms 6440 KB Output is correct
24 Correct 96 ms 6428 KB Output is correct
25 Correct 106 ms 6420 KB Output is correct
26 Correct 97 ms 6416 KB Output is correct
27 Correct 96 ms 6828 KB Output is correct
28 Correct 122 ms 6428 KB Output is correct
29 Correct 108 ms 6416 KB Output is correct
30 Correct 96 ms 6432 KB Output is correct
31 Correct 95 ms 6440 KB Output is correct
32 Correct 100 ms 6420 KB Output is correct
33 Correct 97 ms 6420 KB Output is correct
34 Correct 70 ms 6420 KB Output is correct
35 Correct 97 ms 6416 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Execution timed out 5092 ms 6600 KB Time limit exceeded
40 Halted 0 ms 0 KB -