제출 #1164921

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164921		chiqouz7	Sirni (COCI17_sirni)	C++20	0 / 140	281 ms	263088 KiB

sirni

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
const int N = 1e5;
int p[N+1] = {};
int sz[N+1] = {};
int find(int a){
	if(a == p[a]) return a;
	return p[a] = find(p[a]);
}
void unite(int a, int b){
	if(a != b){
		if(sz[a] < sz[b]) swap(a, b);
		p[b] = a;
		sz[a] += sz[b];
	}
}
int main() {
	int n;
	cin>>n;
	vector<int> v(n);
	int m = 0;
	for(int i = 0; i < n; i++){
		p[i] = i;
		sz[i] = 1;
		cin>>v[i];
		m = max(m, v[i]);
	}
	sort(v.begin(), v.end());
	vector<pair<int, pair<int, int> > > edge;
	vector<pair<int, pair<int, int> > > edges;
	for(int i = 0; i < n; i++){
		for(int j = 1; j*v[i] <= m; j++){
			int x = j*v[i];
			auto it = lower_bound(v.begin(), v.end(), x);
			int ind = it-v.begin();
			if(j == 1) ind++;
			if(ind < n && v[ind] < (x+v[i])) edge.push_back({v[ind]-x, {i, ind}});
			// if(j == 1) 
		}
	}
	vector<vector<pair<int, int> > > e(m);
	for(int i = 0; i < edge.size(); i++){
		e[edge[i].f].push_back(edge[i].s);
	}
	ll ans = 0;
	for(int i = 0; i < m; i++){
		for(int j = 0; j < e[i].size(); j++){
			int a = find(e[i][j].f);
			int b = find(e[i][j].s);
			if(a != b){
				unite(a,b);
				ans += i;
			}
		}
	}
	cout<<ans;
	return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14