oj.uz

Submission #951898

# Submission time Handle Problem Language Result Execution time Memory
951898 2024-03-22T22:15:08 Z xjonwang Sirni (COCI17_sirni) C++17
140 / 140
 1666 ms 656736 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, m; read(n);
	vt<int> v(n); read(v);
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	n=sz(v), m=v.back()+1;
	vt<int> mp(m);
	FOR(i, n-1, 0, -1) FOR(j, v[i], v[i-1], -1) mp[j]=i;
	vt<vt<pii>> e(m);
	int idx=0;
	for (; idx<n && v[idx]<=100; idx++) {
		FOR(j, idx+1, n) e[v[j]%v[idx]].pb({idx, j});
	}
	for (; idx<n; idx++) {
		FOR(j, 2*v[idx], m, v[idx]) e[v[mp[j]]-j].pb({idx, mp[j]});
	}
	FOR(i, 1, n) e[v[i]-v[i-1]].pb({i-1, i});
	dsu d(n);
	ll ans=0;
	FOR(m) 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 100 ms 274256 KB Output is correct
2 Correct 257 ms 305748 KB Output is correct
3 Correct 98 ms 273748 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1200 ms 436180 KB Output is correct
3 Correct 101 ms 275280 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 274260 KB Output is correct
2 Correct 96 ms 273744 KB Output is correct
3 Correct 98 ms 274556 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 41988 KB Output is correct
2 Correct 137 ms 93752 KB Output is correct
3 Correct 60 ms 52760 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29532 KB Output is correct
2 Correct 71 ms 52308 KB Output is correct
3 Correct 55 ms 35960 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 61836 KB Output is correct
2 Correct 170 ms 125768 KB Output is correct
3 Correct 60 ms 51544 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14284 KB Output is correct
2 Correct 156 ms 102400 KB Output is correct
3 Correct 54 ms 47172 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 288084 KB Output is correct
2 Correct 773 ms 506476 KB Output is correct
3 Correct 161 ms 291404 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 287268 KB Output is correct
2 Correct 1459 ms 639352 KB Output is correct
3 Correct 170 ms 295660 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 276564 KB Output is correct
2 Correct 1666 ms 656736 KB Output is correct
3 Correct 62 ms 53500 KB Output is correct