oj.uz

Submission #639469

# Submission time Handle Problem Language Result Execution time Memory
639469 2022-09-10T04:58:26 Z quangphat18ti Sirni (COCI17_sirni) C++14
140 / 140
 3332 ms 574564 KB 
#include <bits/stdc++.h>

using namespace std;

struct DSU {
	int cnt;
	int size;
	vector<int> e;
	DSU (int _) : size (_) {
		e = vector<int> (size, -1);
	}
	int root(int x) {
		return (e[x] < 0 ? x : (e[x] = root(e[x])));
	}
	bool same(int x, int y) {
		return root(x) == root(y);
	}
	void unite(int x, int y) {
		if (same(x, y)) return;
		x = root(x), y = root(y);
		if (-e[x] > -e[y]) {
			swap(x, y);
		}
		e[y] += e[x];
		e[x] = y;
		cnt --;
	}
};

const int N = (int)1e5;
const int Mx = (int)1e7;
int n;
int a[N];
int nxt[Mx + 1];
vector<pair<int, int>> edges[Mx + 1];

void solve() {
	cin >> n;
	for (int i = 0; i < n;i ++) {
		cin >> a[i];
	}
	sort(a, a + n);
	int ptr = 1;
	for (int i = 1; i < n;i  ++) {
		if (a[i] != a[i - 1]) {
			a[ptr] = a[i];
			ptr ++;
		}
	}
	n = ptr;
	for (int i = 0; i < n; i ++) {
		nxt[a[i]] = -(i + 1);
	}
	for (int i = a[n - 1] - 1; i >= 0; i --) {
		if (nxt[i] == 0) {
			nxt[i] = nxt[i + 1];
			if (nxt[i] < 0) nxt[i] *= -1;
		}
	}
	for (int i = 0; i < n - 1; i ++) {
		for (int j = a[i]; j <= a[n - 1]; j += a[i]) {
			int nt;
			if (j == a[i]) {
				nt = (nxt[a[i] + 1] < 0 ? -nxt[a[i] + 1] : nxt[a[i] + 1]);
			} else {
				nt = (nxt[j] < 0 ? -nxt[j] : nxt[j]);

			}
			if (a[nt - 1] >= j + a[i]) continue;
			edges[a[nt - 1] - j].push_back(make_pair(i + 1, nt));
		}
	}
	int64_t ans = 0;
	DSU d(n);
	for (int i = 0; i < a[n - 1]; i ++) {
		for (auto& e : edges[i]) {
			if (!d.same(e.first - 1, e.second - 1)) {
				d.unite(e.first - 1, e.second - 1);
				ans += i;
			}
		}
	}
	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	solve();
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 274348 KB Output is correct
2 Correct 207 ms 276660 KB Output is correct
3 Correct 168 ms 274400 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 235284 KB Output is correct
2 Correct 427 ms 274960 KB Output is correct
3 Correct 168 ms 274560 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 274428 KB Output is correct
2 Correct 180 ms 274180 KB Output is correct
3 Correct 172 ms 274488 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 249624 KB Output is correct
2 Correct 250 ms 276724 KB Output is correct
3 Correct 170 ms 254656 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 240784 KB Output is correct
2 Correct 222 ms 261824 KB Output is correct
3 Correct 149 ms 247648 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 261968 KB Output is correct
2 Correct 275 ms 291432 KB Output is correct
3 Correct 165 ms 253356 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 239808 KB Output is correct
2 Correct 276 ms 286068 KB Output is correct
3 Correct 168 ms 252736 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 287832 KB Output is correct
2 Correct 1442 ms 483804 KB Output is correct
3 Correct 293 ms 290212 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 287500 KB Output is correct
2 Correct 2896 ms 574564 KB Output is correct
3 Correct 339 ms 294124 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 276752 KB Output is correct
2 Correct 3332 ms 570168 KB Output is correct
3 Correct 177 ms 254580 KB Output is correct