#include <bits/stdc++.h>
using namespace std;
using tint = long long;
using ld = long double;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ins insert
#define f first
#define s second
#define mp make_pair
#define DBG(x) cerr << #x << " = " << x << endl;
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 1e5+5;
const tint INF = 1e18;
const int inf = 2e9;
const ld PI = acos(ld(-1));
const ld eps = 1e-5;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
template<class T> void remDup(vector<T> &v){
sort(all(v)); v.erase(unique(all(v)),end(v));
}
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
}
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
bool valid(int x, int y, int n, int m){
return (0<=x && x<n && 0<=y && y<m);
}
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
void NACHO(string name = ""){
ios_base::sync_with_stdio(0); cin.tie(0);
if(sz(name)){
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
vi a;
vpi ed[10000005];
int nxt[10000005];
struct DSU{
vi e; void init(int N){ e = vi(N, -1); }
int get(int x){ return e[x] < 0 ? x : e[x] = get(e[x]); }
bool unite(int x, int y){
x = get(x), y = get(y); if(x == y) return 0;
if(e[x] > e[y]) swap(x, y);
e[x] += e[y]; e[y] = x; return 1;
}
};
int main(){
NACHO();
int n; cin >> n;
a.rsz(n);
F0R(i, n) cin >> a[i];
remDup(a);
n = sz(a);
int cur = 0;
F0R(i, 1e7+1){
while(cur < n && a[cur] < i) ++cur;
if(cur == n) nxt[i] = -1;
else nxt[i] = cur;
}
F0R(i, n){
int id = nxt[a[i]+1];
if(id != -1) ed[a[id] % a[i]].pb(mp(id, i));
for(int k = 2*a[i]; k <= a.back(); k += a[i]){
id = nxt[k];
if(id != -1) ed[a[id] % a[i]].pb(mp(id, i));
else break;
}
}
DSU D; D.init(n);
tint ans = 0;
F0R(i, 1e7+1){
trav(o, ed[i]){
int u = o.f, v = o.s;
if(D.unite(u, v)) ans += i;
}
}
cout << ans << "\n";
}
Compilation message
sirni.cpp: In function 'void NACHO(std::string)':
sirni.cpp:69:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
69 | freopen((name+".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:70:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
70 | freopen((name+".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
225 ms |
274440 KB |
Output is correct |
| 2 |
Correct |
337 ms |
303860 KB |
Output is correct |
| 3 |
Correct |
226 ms |
274796 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
207 ms |
274412 KB |
Output is correct |
| 2 |
Correct |
1842 ms |
669152 KB |
Output is correct |
| 3 |
Correct |
205 ms |
275180 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
199 ms |
274412 KB |
Output is correct |
| 2 |
Correct |
205 ms |
274412 KB |
Output is correct |
| 3 |
Correct |
204 ms |
274540 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
293 ms |
284580 KB |
Output is correct |
| 2 |
Correct |
444 ms |
312592 KB |
Output is correct |
| 3 |
Correct |
315 ms |
295392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
216 ms |
276204 KB |
Output is correct |
| 2 |
Correct |
411 ms |
297580 KB |
Output is correct |
| 3 |
Correct |
267 ms |
284660 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
378 ms |
296496 KB |
Output is correct |
| 2 |
Correct |
488 ms |
329952 KB |
Output is correct |
| 3 |
Correct |
307 ms |
293572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
222 ms |
277984 KB |
Output is correct |
| 2 |
Correct |
528 ms |
330928 KB |
Output is correct |
| 3 |
Correct |
311 ms |
295116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
365 ms |
288236 KB |
Output is correct |
| 2 |
Correct |
2201 ms |
633300 KB |
Output is correct |
| 3 |
Correct |
379 ms |
291512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
415 ms |
292096 KB |
Output is correct |
| 2 |
Correct |
4240 ms |
746920 KB |
Output is correct |
| 3 |
Correct |
614 ms |
348596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
233 ms |
276716 KB |
Output is correct |
| 2 |
Correct |
4236 ms |
635132 KB |
Output is correct |
| 3 |
Correct |
317 ms |
297940 KB |
Output is correct |
