답안 #89207 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89207	2018-12-11T00:49:40 Z	jasony123123	Sirni (COCI17_sirni)	C++11	14 / 140	1364 ms	787456 KB

sirni

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R6 P4*************************/

template <int SZ> struct UF {
	int N; // Vertices 0...N-1
	int par[SZ], compsz[SZ]; // parent of i, size of component
	UF() {
		FOR(i, 0, SZ) par[i] = i, compsz[i] = 1;
	}
	int find(int x) { // path compression
		if (par[x] != x) par[x] = find(par[x]);
		return par[x];
	}
	bool unite(int x, int y) { // unite by rank. return TRUE if united. FALSE if already same component
		x = find(x), y = find(y);
		if (x == y) return false;
		if (compsz[x] < compsz[y]) swap(x, y); // now x is the larger component
		compsz[x] += compsz[y], par[y] = x;
		return true;
	}
};

int N, M;
v<int> P;
int nxt[10000000];
v<pair<int, pii>> edges;
UF<100000> uf;

void input() {
	cin >> N;
	P.resize(N);
	FOR(i, 0, N) cin >> P[i];
	sort(P.begin(), P.end());
	P.erase(unique(P.begin(), P.end()), P.end());
	N = P.size();
	M = P.back();
}

void preComp() {
	// compute nxt
	for (int i = M, j = P.size() - 1; i >= P.front(); i--) {
		if (j >= 0 && i == P[j])
			nxt[i] = j--;
		else
			nxt[i] = nxt[i + 1];
	}

	FOR(i, 0, N) {
		pair<int, pii> e = { P[nxt[P[i] + 1]] % P[i],{ i, nxt[P[i] + 1] } };
		edges.push_back(e);
		for (int k = P[i] + P[i]; k <= M; k += P[i]) {
			e = { P[nxt[k]] % P[i],{ i, nxt[k] } };
			edges.push_back(e);
		}
	}
}

int main() {
	io();
	input();
	preComp();

	// init count sort
	sort(all(edges));

	// mst -Run time error somwhere here
	int num = 0;
	ll mstcost = 0;
	for (auto& e : edges) {
		if (uf.unite(e.second.first, e.second.second)) {
			mstcost += (ll)(e.first);
			num++;
		}
		if (num == N - 1) break;
	}

	cout << mstcost << "\n";
	return 0;
}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	40184 KB	Output is correct
2	Correct	492 ms	89736 KB	Output is correct
3	Correct	59 ms	89736 KB	Output is correct

Subtask #2
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	89736 KB	Output is correct
2	Runtime error	1364 ms	787456 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	57 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	243 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	40 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	515 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	75 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	366 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	422 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	95 ms	787456 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

답안 #89207

Compilation message