#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];
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);
assert(is_sorted(all(a)));
n = sz(a);
F0R(i, n){
int id = upper_bound(all(a), a[i])-a.begin();
if(id != n) ed[a[id] % a[i]].pb(mp(id, i));
for(int k = 2*a[i]; k <= a.back(); k += a[i]){
id = lower_bound(all(a), k)-a.begin();
if(id != n) ed[a[id] % a[i]].pb(mp(id, i));
}
}
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:14: 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:14: 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 |
167 ms |
235372 KB |
Output is correct |
| 2 |
Correct |
287 ms |
264684 KB |
Output is correct |
| 3 |
Correct |
171 ms |
235520 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
168 ms |
235244 KB |
Output is correct |
| 2 |
Correct |
1970 ms |
630168 KB |
Output is correct |
| 3 |
Correct |
180 ms |
236012 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
167 ms |
235372 KB |
Output is correct |
| 2 |
Correct |
166 ms |
235372 KB |
Output is correct |
| 3 |
Correct |
168 ms |
235372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
303 ms |
245556 KB |
Output is correct |
| 2 |
Correct |
641 ms |
273508 KB |
Output is correct |
| 3 |
Correct |
371 ms |
256076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
187 ms |
237164 KB |
Output is correct |
| 2 |
Correct |
364 ms |
258412 KB |
Output is correct |
| 3 |
Correct |
299 ms |
245624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
467 ms |
257360 KB |
Output is correct |
| 2 |
Correct |
778 ms |
290968 KB |
Output is correct |
| 3 |
Correct |
362 ms |
254276 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
225 ms |
238816 KB |
Output is correct |
| 2 |
Correct |
741 ms |
291928 KB |
Output is correct |
| 3 |
Correct |
362 ms |
255948 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
330 ms |
248940 KB |
Output is correct |
| 2 |
Correct |
3247 ms |
593572 KB |
Output is correct |
| 3 |
Correct |
361 ms |
251448 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
357 ms |
252928 KB |
Output is correct |
| 2 |
Correct |
4564 ms |
707152 KB |
Output is correct |
| 3 |
Correct |
698 ms |
308788 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
191 ms |
237548 KB |
Output is correct |
| 2 |
Correct |
3885 ms |
595420 KB |
Output is correct |
| 3 |
Correct |
387 ms |
258136 KB |
Output is correct |
