oj.uz

Submission #951851

# Submission time Handle Problem Language Result Execution time Memory
951851 2024-03-22T20:36:57 Z xjonwang Sirni (COCI17_sirni) C++17
28 / 140
 4858 ms 786432 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
	return to_string(x.first) + ' ' + to_string(x.second);
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

struct dsu {
	vt<int> e;
	dsu(int n) : e(vt<int>(n, -1)) {}
	int get(int x) { return e[x]<0 ? x : e[x]=get(e[x]); }
	int size(int x) { return e[x]<0 ? -e[x] : size(e[x]); }
	bool unite(int x, int y) {
		x=get(x), y=get(y);
		if (x==y) return false;
		if (e[x]>e[y]) swap(x, y);
		e[x]+=e[y];
		e[y]=x;
		return true;
	}
};

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n; read(n);
	vt<int> v(n); read(v);
	sort(all(v));
	vt<vt<int>> fac(1e7+1);
	FOR(n-1) {
		FOR(j, 2*v[i], 1e7+1, v[i]) fac[j].pb(i);
	}
	vt<vt<pii>> e(1e7+1);
	FOR(i, 1, n) {
		FOR(j, v[i], v[i-1]-1, -1) {
			EACH(x, fac[j]) e[v[i]-j].pb({x, i});
			fac[j].clear();
		}
		e[v[i]-v[i-1]].pb({i-1, i});
	}
	dsu d(n);
	ll ans=0;
	FOR(1e7+1) EACH(x, e[i]) if (d.unite(x.f, x.s)) ans+=i;
	print(ans);
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 470356 KB Output is correct
2 Correct 927 ms 572620 KB Output is correct
3 Correct 214 ms 471124 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1112 ms 605040 KB Output is correct
2 Runtime error 3656 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 470388 KB Output is correct
2 Correct 206 ms 470192 KB Output is correct
3 Correct 215 ms 470828 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1777 ms 637684 KB Output is correct
2 Runtime error 4217 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 518220 KB Output is correct
2 Runtime error 3966 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3904 ms 754072 KB Output is correct
2 Runtime error 3925 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2564 ms 706276 KB Output is correct
2 Runtime error 4372 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 517716 KB Output is correct
2 Runtime error 3798 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 534196 KB Output is correct
2 Runtime error 4858 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 477520 KB Output is correct
2 Runtime error 4557 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -