#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e6+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
int p[N],sz[N],a[N];
vector<int>is[(int)1e7+1];
int get_p(int v) {
return (v==p[v] ? v : p[v]=get_p(p[v]));
}
bool mg(int a,int b){
int ra=get_p(a),rb=get_p(b);
if(ra!=rb){
if(sz[rb]>sz[ra]) swap(ra,rb);
p[rb]=ra;
sz[ra]+=sz[rb];
}
}
signed main()
{
fast_io;
int n;
cin>>n;
iota(p,p+n,0);
vector<pair<int,pii>>e;
for(int i=0;i<n;i++){
cin>>a[i];
sz[i]=1;
}
sort(a,a+n);
for(int i=0;i<n;i++){
is[a[i]].p_b(i);
}
int cnt=0;
ll ans=0;
int fs,f=0;
int ps=0;
for(int i=0;i<a[0] && cnt!=n-1;i++){
for(int k=0;k<n && cnt!=n-1;k++){
f=0;
for(int t=i;t<=a[n-1] && cnt!=n-1;t+=a[k]){
f=lower_bound(a+f,a+n,t)-a;
if(f==n) break;
ps=a[f]/a[k];
if(a[f]%a[k]<i) ps++;
f=lower_bound(a+f,a+n,ps*a[k]+i)-a;
if(f==n) break;
ps=a[f]/a[k];
if(a[f]%a[k]<i) ps++;
t=(ps*a[k]+i);
if(a[f]==t){
for(auto &z : is[t]){
if(get_p(z)!=get_p(k)){
mg(z,k);cnt++;ans+=i;
}
}
}
}
}
}
cout<<ans;
return 0;
}
/*
4 4
1 2 a
3 2 a
1 4 a
3 4 b
*/
Compilation message
sirni.cpp: In function 'bool mg(int, int)':
sirni.cpp:92:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
sirni.cpp: In function 'int main()':
sirni.cpp:110:9: warning: unused variable 'fs' [-Wunused-variable]
int fs,f=0;
^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3375 ms |
235280 KB |
Output is correct |
| 2 |
Incorrect |
251 ms |
235256 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
121 ms |
235256 KB |
Output is correct |
| 2 |
Correct |
124 ms |
235272 KB |
Output is correct |
| 3 |
Incorrect |
217 ms |
235256 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3038 ms |
235336 KB |
Output is correct |
| 2 |
Correct |
688 ms |
235280 KB |
Output is correct |
| 3 |
Incorrect |
1702 ms |
235288 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1036 ms |
239480 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
322 ms |
235896 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2106 ms |
239404 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
324 ms |
236664 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
5104 ms |
239504 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1452 ms |
239532 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
5076 ms |
236024 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
