Submission #55316

#	Time	Username	Problem	Language	Result	Execution time	Memory
55316		IvanC	Sirni (COCI17_sirni)	C++17	0 / 140	1118 ms	107788 KiB

sirni

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef tuple<int,int,int> trinca;

const int MAXN = 1e7 + 1;

int pai[MAXN],proximo[MAXN],N;
vector<int> ordenado;
vector<trinca> Kruskal; 

int find(int x){
	if(x == pai[x]) return x;
	return pai[x] = find(pai[x]);
}

void join(int x,int y){
	x = find(x);y = find(y);
	if(x == y) return;
	if(rand() & 1) swap(x,y);
	pai[y] = x;
}

int main(){

	scanf("%d",&N);
	for(int i = 1;i<=N;i++){
		int x;
		scanf("%d",&x);
		pai[x] = x;
	}

	for(int i = 1;i<MAXN;i++){
		if(pai[i] != i) continue;
		ordenado.push_back(i);
	}

	int ultimo_visto = ordenado.back();

	for(int i = MAXN-1;i>=1;i--){
		proximo[i] = ultimo_visto;
		if(!ordenado.empty() && ordenado.back() == i){
			ultimo_visto = i;
			ordenado.pop_back();
		}
	}

	for(int i = 1;i<MAXN;i++){
		if(pai[i] != i) continue;
		ultimo_visto = -1;
		for(int j = i;j<MAXN;j+=i){
			int candidato = proximo[j];
			if(candidato == ultimo_visto) continue;
			ultimo_visto = candidato;
			Kruskal.push_back(make_tuple(candidato % i,i,candidato));
		}
	}
	sort(Kruskal.begin(),Kruskal.end());

	ll total = 0;
	for(trinca  davez : Kruskal){

		int w = get<0>(davez),u = get<1>(davez),v = get<2>(davez);
		if(find(u) != find(v)){
			join(u,v);
			total += w;
		}
	}

	printf("%lld\n",total);

	return 0;
}

Compilation message (stderr)

sirni.cpp: In function 'int main()':
sirni.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
  ~~~~~^~~~~~~~~
sirni.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~

• 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