Submission #24251

#	Time	Username	Problem	Language	Result	Execution time	Memory
24251		Bruteforceman	Sirni (COCI17_sirni)	C++11	0 / 140	656 ms	120484 KiB

sirni

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

struct edge
{
	int u, v, cost;
	edge () {}
	edge (int u, int v, int cost) : u(u), v(v), cost(cost) {}
	bool operator < (edge e) const {
		return cost < e.cost;
	}
};

vector <int> node;
vector <edge> e;
const int maxn = 10000000;
int nxt[maxn + 5];

int par[100010];
int sub[100010];

int root(int x) {
	if(x == par[x]) return x;
	else return par[x] = root(par[x]);
}
void join(int x, int y) {
	x = root(x);
	y = root(y);
	if(sub[x] > sub[y]) swap(x, y);
	if(x != y) {
		par[x] = y;
		sub[y] += sub[x];
	}
}

int main(int argc, char const *argv[])
{
	set <int> s;
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		par[i] = i;
		sub[i] = 1;

		int p;
		scanf("%d", &p);
		s.insert(p);
	}
	node = vector <int> (s.begin(), s.end());

	memset(nxt, -1, sizeof nxt);
	nxt[maxn + 1] = n;

	for(size_t i = 0; i < node.size(); i++) {
		nxt[node[i]] = i;
	}
	for(int i = maxn; i >= 0; i--) {
		if(nxt[i] == -1){
			nxt[i] = nxt[i + 1];
		}
	}

	for(size_t i = 0; i < node.size(); i++) {
		for(int j = 0; j <= maxn; j += node[i]) {
			if(nxt[j] < (int) node.size()) {
				e.push_back(edge(i, nxt[j], node[nxt[j]] - j));
			}
		}
	}
	sort(e.begin(), e.end());

	long long ans = 0;
	for(size_t i = 0; i < e.size(); i++) {
		int u = e[i].u;
		int v = e[i].v;
		int cost = e[i].cost;
		if(root(u) != root(v)) {
			join(u, v);
			ans += cost;
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message (stderr)

sirni.cpp: In function 'int main(int, const char**)':
sirni.cpp:40:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
sirni.cpp:46:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p);
                  ^

• 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