#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
template <class T>
using VV = vector<vector<T>>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<long long>;
using VVL = vector<vector<long long>>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
using PIL = pair<int, long long>;
using PLI = pair<long long, int>;
using VPII = vector<pair<int, int>>;
using VPLL = vector<pair<long long, long long>>;
#define LINE '\n'
#define SPACE ' '
#define PB push_back
#define FOR(i, a, b) for (int i = (a); i < (int(b)); i++)
#define FORE(i, a, b) for (int i = (a); i <= (int)((b)); i++)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sq(a) ((a) * (a))
#define sz(x) ((int)s.size())
// zero indexed
template <class T>
struct segtree
{
const T def = 0;
int n;
vector<T> seg;
segtree(int _size) : n(_size), seg(2 * _size, def) {}
T merge(T a, T b)
{
return max(a, b);
}
void update(int pos, T val)
{
for (seg[pos += n] = val; pos /= 2;)
{
seg[pos] = merge(seg[pos * 2], seg[pos * 2 + 1]);
}
}
T query(int l, int r)
{ // get [l, r]
T a = def, b = def;
for (l += n, r += n + 1; l < r; l /= 2, r /= 2)
{
if (l % 2)
a = merge(a, seg[l++]);
if (r % 2)
b = merge(b, seg[--r]);
}
return merge(a, b);
}
};
const ll MOD = 1e9 + 7;
template <class T>
void maxi(T &a, T b)
{
a = max(a, b);
}
template <class T>
void mini(T &a, T b)
{
a = min(a, b);
}
template <class T>
void addi(T &a, T b)
{
a = (a + b) % MOD;
}
template <class T>
void subi(T &a, T b)
{
a = (a - b + MOD) % MOD;
}
template <class T>
T add(T a, T b)
{
return (a + b) % MOD;
}
template <class T>
T sub(T a, T b)
{
return (a - b + MOD) % MOD;
}
template <class T>
T mul(T a, T b)
{
return ((a % MOD) * (b % MOD)) % MOD;
}
ll binpow(ll a, ll b, ll mod)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
{
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return res;
}
struct DSU
{
VI par;
VI size;
DSU(int _n) : par(_n), size(_n, 1)
{
iota(ALL(par), 0);
}
bool merge(int x, int y)
{
x = find(x);
y = find(y);
if (x == y)
return false;
if (size[y] > size[x])
swap(x, y);
size[x] += size[y];
par[y] = x;
return true;
}
int find(int x)
{
return (par[x] == x ? x : par[x] = find(par[x]));
}
bool connected(int x, int y)
{
return find(x) == find(y);
}
void reset()
{
FOR(i, 0, par.size())
par[i] = i,
size[i] = 1;
}
};
const int INF = 1e9;
const int MAX_N = 1e3 + 4;
void solve()
{
int n;
cin >> n;
VI p(n);
FOR(i, 0, n)
{
cin >> p[i];
}
sort(ALL(p));
p.erase(unique(ALL(p)), p.end());
n = p.size();
int mx = p.back();
VI next(mx + 1, -1);
FOR(i, 0, n)
{
next[p[i]] = i;
}
for (int i = mx - 1; i >= 0; i--)
{
if (next[i] == -1)
{
next[i] = next[i + 1];
}
}
VV<PII> g(mx + 1);
FOR(i, 0, n - 1)
{
g[p[i+1] % p[i]].PB({i, i + 1});
for (int at = 2 * p[i]; at <= mx; at += p[i])
{
int tmp = next[at];
g[p[tmp] % p[i]].PB({i, tmp});
}
}
DSU dsu(n + 3);
int ans = 0;
FOR(i, 0, mx + 1) {
for(auto &[a, b] : g[i]) {
if(dsu.merge(a, b)) ans += i;
}
}
cout << ans << LINE;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
134 ms |
274260 KB |
Output is correct |
| 2 |
Correct |
198 ms |
302628 KB |
Output is correct |
| 3 |
Correct |
141 ms |
273492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
624 KB |
Output is correct |
| 2 |
Correct |
857 ms |
668756 KB |
Output is correct |
| 3 |
Correct |
135 ms |
275024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
132 ms |
274232 KB |
Output is correct |
| 2 |
Correct |
139 ms |
273796 KB |
Output is correct |
| 3 |
Correct |
133 ms |
274364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
39052 KB |
Output is correct |
| 2 |
Correct |
97 ms |
67072 KB |
Output is correct |
| 3 |
Correct |
63 ms |
49708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
29816 KB |
Output is correct |
| 2 |
Correct |
70 ms |
51324 KB |
Output is correct |
| 3 |
Correct |
38 ms |
25252 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
50552 KB |
Output is correct |
| 2 |
Correct |
127 ms |
83912 KB |
Output is correct |
| 3 |
Correct |
58 ms |
47532 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
9936 KB |
Output is correct |
| 2 |
Correct |
122 ms |
84760 KB |
Output is correct |
| 3 |
Correct |
58 ms |
49212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
185 ms |
289364 KB |
Output is correct |
| 2 |
Correct |
1067 ms |
633580 KB |
Output is correct |
| 3 |
Correct |
191 ms |
291744 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
196 ms |
293092 KB |
Output is correct |
| 2 |
Correct |
1241 ms |
747048 KB |
Output is correct |
| 3 |
Correct |
292 ms |
348572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
145 ms |
276856 KB |
Output is correct |
| 2 |
Correct |
1103 ms |
634620 KB |
Output is correct |
| 3 |
Correct |
65 ms |
51168 KB |
Output is correct |
