Submission #1020861

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1020861	2024-07-12T10:35:59 Z	Unforgettablepl	Reconstruction Project (JOI22_reconstruction)	C++17	0 / 100	5000 ms	12240 KB

reconstruction

#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);
		};
		vector<int> currbest(n+1,-1);
		for(int i=0;i<m;i++){
			replaces_front[i] = currbest[edges[i].second.first];
			currbest[edges[i].second.first]=i;
		}
	}
	vector<int> replaces_back(m,-1);
	vector<int> currbest(n+1,-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--){
			replaces_back[i] = currbest[edges[i].second.first];
			currbest[edges[i].second.first]=i;
		}
	}
	set<int> curr_left;
	set<int> curr_right;
	vector<pair<int,int>> curredgesl;
	vector<pair<int,int>> curredgesr;
	bool changed;
	for(auto&i:currbest)if(i!=-1)curr_right.insert(i);
	for(int i:curr_right)curredgesr.emplace_back(0,i);
	vector<bool> blacklist(m+1);
	auto solve = [&](int x){
		if(changed){
			curredgesl.clear();
			for(int i:curr_left){
				curredgesl.emplace_back(x-edges[i].first,i);
			}
			sort(curredgesl.begin(),curredgesl.end());
			curredgesr.clear();
			for(int i:curr_right){
				curredgesr.emplace_back(edges[i].first-x,i);
			}
			sort(curredgesr.begin(),curredgesr.end());
		} else {
			for(auto&[c,i]:curredgesl)c=x-edges[i].first;
			for(auto&[c,i]:curredgesr)c=edges[i].first-x;
		}
		for(auto[c,i]:curredgesl)blacklist[i+1]=false;
		for(auto[c,i]:curredgesr)blacklist[i+1]=false;
		auto iterl = curredgesl.begin();
		auto iterr = curredgesr.begin();
		int ans = 0;
		int cnt = 1;
		while(cnt<n){
			if(iterl==curredgesl.end()){
				if(!blacklist[iterr->second+1]){
					ans+=iterr->first;
					blacklist[replaces_front[iterr->second]+1]=true;
					cnt++;
				}
				iterr++;
			} else if(iterr==curredgesr.end()){
				if(!blacklist[iterl->second+1]){
					ans+=iterl->first;
					blacklist[replaces_back[iterl->second]+1]=true;
					cnt++;
				}
				iterl++;
			} else if(iterl->first<iterr->first){
				if(!blacklist[iterl->second+1]){
					ans+=iterl->first;
					blacklist[replaces_back[iterl->second]+1]=true;
					cnt++;
				}
				iterl++;
			} else {
				if(!blacklist[iterr->second+1]){
					ans+=iterr->first;
					blacklist[replaces_front[iterr->second]+1]=true;
					cnt++;
				}
				iterr++;
			}
		}
		return ans;
	};
	int iter = 0;
	int q;
	cin >> q;
	for(int i=1;i<=q;i++){
		int query;
		cin >> query;
		changed = false;
		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++;
			changed = true;
		}
		cout << solve(query) << '\n';
	}
}

Subtask #1
0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Execution timed out	5094 ms	12240 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-