// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"
using namespace std;
const int N = 1e7 + 600;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;
int n, par[N], sz[N];
int find(int v) {
if(v == par[v]) return v;
return par[v] = find(par[v]);
}
bool join(int x, int y) {
x = find(x); y = find(y);
if(x != y) {
if(sz[x] < sz[y]) swap(x, y);
par[y] = x;
sz[x] += sz[y];
return true;
}
return false;
}
void to_nho_cau() {
cin >> n;
vector<int> a;
forr(i, 1, n) {
int x; cin >> x;
a.pb(x);
}
if(a.size()) {
sort(all(a)); a.resize(unique(all(a)) - a.begin());
}
int mx = a.back();
vector<int> nxt(mx + 500, -1);
forf(i, 0, a.size()) {
nxt[a[i]] = i;
}
ford(i, mx-1, 0) {
if(nxt[i] == -1) nxt[i] = nxt[i+1];
}
vector<vector<pair<int, int>>> f(mx + 1);
for (int i = 0; i < a.size() - 1; i++) {
// get all relevant cards this card could be connected to
f[a[i + 1] % a[i]].push_back({i, i + 1});
for (int at = 2 * a[i]; at <= mx; at += a[i]) {
int good_mod = nxt[at];
f[a[good_mod] % a[i]].push_back({i, good_mod});
}
}
forr(i, 0, mx + 500) {
par[i] = i;
sz[i] = 1;
}
ll ans = 0;
forr(i, 0, mx) {
for(pii e: f[i]) {
int u = e.st, v = e.nd;
if(join(u, v)) {
ans = ans + i;
}
}
}
cout << ans << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
#ifdef LOCAL
freopen(file".inp","r",stdin);
freopen(file".out","w",stdout);
#endif
int t = 1;
//cin >> t;
while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
∧__∧
（｀•ω• )づ__∧
（つ /( •ω•。)
しーＪ (nnノ) pat pat
**/
/** /\_/\
* (= ._.)
* / >☕ \>💻
**/
Compilation message
sirni.cpp:113:9: warning: "/*" within comment [-Wcomment]
113 | /** /\_/\
|
sirni.cpp: In function 'void to_nho_cau()':
sirni.cpp:6:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
6 | #define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
| ^
sirni.cpp:58:5: note: in expansion of macro 'forf'
58 | forf(i, 0, a.size()) {
| ^~~~
sirni.cpp:65:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for (int i = 0; i < a.size() - 1; i++) {
| ~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
176 ms |
352488 KB |
Output is correct |
| 2 |
Correct |
265 ms |
380652 KB |
Output is correct |
| 3 |
Correct |
193 ms |
351560 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
4944 KB |
Output is correct |
| 2 |
Correct |
1038 ms |
746468 KB |
Output is correct |
| 3 |
Correct |
165 ms |
353304 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
170 ms |
352584 KB |
Output is correct |
| 2 |
Correct |
163 ms |
352040 KB |
Output is correct |
| 3 |
Correct |
168 ms |
352584 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
42 ms |
48188 KB |
Output is correct |
| 2 |
Correct |
92 ms |
83264 KB |
Output is correct |
| 3 |
Correct |
58 ms |
60596 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
40272 KB |
Output is correct |
| 2 |
Correct |
63 ms |
61904 KB |
Output is correct |
| 3 |
Correct |
38 ms |
31316 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
63 ms |
64404 KB |
Output is correct |
| 2 |
Correct |
120 ms |
99688 KB |
Output is correct |
| 3 |
Correct |
56 ms |
59308 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
15928 KB |
Output is correct |
| 2 |
Correct |
124 ms |
97760 KB |
Output is correct |
| 3 |
Correct |
74 ms |
60856 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
245 ms |
366552 KB |
Output is correct |
| 2 |
Correct |
1081 ms |
711644 KB |
Output is correct |
| 3 |
Correct |
253 ms |
370432 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
245 ms |
370624 KB |
Output is correct |
| 2 |
Runtime error |
1135 ms |
786432 KB |
Execution killed with signal 9 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
200 ms |
354888 KB |
Output is correct |
| 2 |
Correct |
1146 ms |
712384 KB |
Output is correct |
| 3 |
Correct |
65 ms |
63928 KB |
Output is correct |
