oj.uz

답안 #357890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
357890 2021-01-24T22:28:22 Z MetB Sirni (COCI17_sirni) C++14
140 / 140
 1547 ms 408692 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
 
const ll N = 2000001;
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
const int maxa = (int)1e7 + 1;
int a[N], n;

int p[N], sz[N], e[maxa + 1], u[maxa + 1];

vector<pair<int, int>> v[maxa + 1];

int f(int i, int j) {
	if (a[i] > a[j]) swap(i, j);
	return a[j] % a[i];
}

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

bool unite(int a, int b) {
	a = find(a), b = find(b);
	if (a == b) return false;

	if (sz[a] < sz[b]) swap(a, b);

	sz[a] += sz[b];
	p[b] = a;

	return true;
}

int main() {

	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;

	fill(e, e + maxa + 1, -1);
	fill(u, u + maxa + 1, -1);

	for (int i = 0; i < n; i++) {
		sz[i] = 1, p[i] = i;
	}

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	sort(a, a + n);

	for (int i = 0; i < n; i++) {
		e[a[i]] = i;
	}


	for (int i = maxa - 1; i >= 0; i--) {
		if (e[i] == -1) e[i] = e[i+1];
	}

	for (int i = 0; i < n; i++) {

		if (e[a[i] + 1] != -1) v[f(i, e[a[i] + 1])].push_back({i, e[a[i] + 1]});

		if (u[a[i]] != -1) {
			//cout << a[i] << ' ' << a[u[a[i]]] << endl;
			v[0].push_back({u[a[i]], i});
			continue;
		}

		u[a[i]] = i;

		for (int k = 2 * a[i]; k < maxa; k += a[i]) {
			u[k] = i;
			//if (e[k] != -1) cout << k << ' ' << i << ' ' << e[k] << ' ' << a[e[k]] << endl;
			if (e[k] != -1 && a[e[k]] <= k + a[i]) {
				//cout << a[e[k]] << ' ' << k << ' ' << e[k] << endl;
				v[a[e[k]] - k].push_back({i, e[k]});
			}
		}
	}

	ll ans = 0;

	for (int i = 0; i <= maxa; i++) {
		for (auto& x : v[i]) {
			if (unite(x.first, x.second)) {
				ans += i;
				//cout << a[x.first] << ' ' << a[x.second] << ' ' << f(x.first, x.second) << endl;
			}
		}	
	}

	cout << ans;

}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 313708 KB Output is correct
2 Correct 318 ms 316140 KB Output is correct
3 Correct 251 ms 313836 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 333 ms 313836 KB Output is correct
2 Correct 373 ms 313708 KB Output is correct
3 Correct 251 ms 313708 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 313580 KB Output is correct
2 Correct 250 ms 313580 KB Output is correct
3 Correct 253 ms 313708 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 483 ms 322048 KB Output is correct
2 Correct 586 ms 328356 KB Output is correct
3 Correct 539 ms 327884 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 315180 KB Output is correct
2 Correct 635 ms 327764 KB Output is correct
3 Correct 544 ms 322540 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 602 ms 327084 KB Output is correct
2 Correct 539 ms 329368 KB Output is correct
3 Correct 446 ms 323012 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 448 ms 316204 KB Output is correct
2 Correct 592 ms 327128 KB Output is correct
3 Correct 504 ms 325980 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 405 ms 326120 KB Output is correct
2 Correct 739 ms 373308 KB Output is correct
3 Correct 427 ms 328628 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 325468 KB Output is correct
2 Correct 1105 ms 382868 KB Output is correct
3 Correct 482 ms 332444 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 280 ms 316012 KB Output is correct
2 Correct 1547 ms 408692 KB Output is correct
3 Correct 526 ms 327644 KB Output is correct