| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 248348 |
2020-07-12T09:25:54 Z |
ne4eHbKa |
Sirni (COCI17_sirni) |
C++17 |
|
4294 ms |
565368 KB |
//{ <defines>
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e5 + 5;
const int M = 1e7 + 1;
const int P = 3163;
int n, a[N], p[N], v;
bool mk[N];
ll ans;
int get(int i) {re p[i] == i ? i : p[i] = get(p[i]);}
void unite(int i, int j, int t) {
i = get(i);
j = get(j);
if(i == j) return;
--v;
ans += t;
p[j] = i;
}
map< int, forward_list<pii> > t;
void add(int e, int i, int j) {
ifn(e) {unite(i, j, 0); mk[j] = true; return;}
t[e].emplace_front(i, j);
}
void solve() {
cin >> n;
fo(n) cin >> a[i];
sort(a, a + n);
n = unique(a, a + n) - a;
fo(n) p[i] = i; v = n - 1;
t.clear();
clr(mk, 0);
for(int i = 0; i < n; ++i) if(!mk[i]) {
for(int j = a[i] + a[i]; j <= a[n - 1]; j += a[i]) {
int f = lower_bound(a, a + n, j) - a;
add(a[f] % a[i], i, f);
}
}
fo(n - 1) add(a[i + 1] % a[i], i, i + 1);
ans = 0;
for(const auto &z : t) {
for(auto i : z.sd) {
unite(i.ft, i.sd, z.ft);
ifn(v) re void(cout << ans << endl);
}
}
exit(5);
cout << "wat\n";
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
sirni.cpp: In function 'int m_bpow(ll, ll)':
sirni.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
sirni.cpp: In function 'void solve()':
sirni.cpp:9:18: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
#define fr(i, n) for(int i = 0; i < n; ++i)
^
sirni.cpp:10:15: note: in expansion of macro 'fr'
#define fo(n) fr(i, n)
^~
sirni.cpp:93:5: note: in expansion of macro 'fo'
fo(n) p[i] = i; v = n - 1;
^~
sirni.cpp:93:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
fo(n) p[i] = i; v = n - 1;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
896 KB |
Output is correct |
| 2 |
Correct |
303 ms |
87288 KB |
Output is correct |
| 3 |
Correct |
7 ms |
1664 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
640 KB |
Output is correct |
| 2 |
Correct |
1052 ms |
447376 KB |
Output is correct |
| 3 |
Correct |
9 ms |
2944 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
896 KB |
Output is correct |
| 2 |
Correct |
1 ms |
640 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1152 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
237 ms |
23928 KB |
Output is correct |
| 2 |
Correct |
416 ms |
49020 KB |
Output is correct |
| 3 |
Correct |
362 ms |
55296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
43 ms |
5776 KB |
Output is correct |
| 2 |
Correct |
389 ms |
39416 KB |
Output is correct |
| 3 |
Correct |
198 ms |
21624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
401 ms |
39416 KB |
Output is correct |
| 2 |
Correct |
348 ms |
48248 KB |
Output is correct |
| 3 |
Correct |
214 ms |
32168 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
7032 KB |
Output is correct |
| 2 |
Correct |
389 ms |
54796 KB |
Output is correct |
| 3 |
Correct |
320 ms |
48248 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
453 ms |
41080 KB |
Output is correct |
| 2 |
Correct |
2505 ms |
411032 KB |
Output is correct |
| 3 |
Correct |
539 ms |
52216 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
426 ms |
53240 KB |
Output is correct |
| 2 |
Correct |
3351 ms |
565368 KB |
Output is correct |
| 3 |
Correct |
994 ms |
229656 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
59 ms |
6648 KB |
Output is correct |
| 2 |
Correct |
4294 ms |
494812 KB |
Output is correct |
| 3 |
Correct |
343 ms |
51192 KB |
Output is correct |
