Submission #248348

#	Time	Username	Problem	Language	Result	Execution time	Memory
248348		ne4eHbKa	Sirni (COCI17_sirni)	C++17	140 / 140	4294 ms	565368 KiB

sirni

//{ <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 (stderr)

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;
                     ^

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14