oj.uz

답안 #1084718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084718 2024-09-06T18:22:18 Z DaciejMaciej Sirni (COCI17_sirni) C++17
14 / 140
 236 ms 380496 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;

template <class T>

using VV = vector<vector<T>>;

// int
using VI = vector<int>;
using VVI = vector<vector<int>>;

// ll
using VL = vector<long long>;
using VVL = vector<vector<long long>>;

// char
using VC = vector<char>;
using VVC = vector<vector<char>>;

// bool
using VB = vector<bool>;
using VVB = vector<vector<bool>>;

// double
using VD = vector<double>;
using VVD = vector<vector<double>>;

// pairs
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
using PIL = pair<int, long long>;
using PLI = pair<long long, int>;

using VPII = vector<pair<int, int>>;
using VPLL = vector<pair<long long, long long>>;

#define LINE '\n'
#define SPACE ' '
#define PB push_back
#define FOR(i, a, b) for (int i = (a); i < (int(b)); i++)
#define FORE(i, a, b) for (int i = (a); i <= (int)((b)); i++)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sq(a) ((a) * (a))
#define sz(x) ((int)s.size())

// zero indexed
template <class T>
struct segtree
{
    const T def = 0;
    int n;
    vector<T> seg;

    segtree(int _size) : n(_size), seg(2 * _size, def) {}

    T merge(T a, T b)
    {
        return max(a, b);
    }
    void update(int pos, T val)
    {
        for (seg[pos += n] = val; pos /= 2;)
        {
            seg[pos] = merge(seg[pos * 2], seg[pos * 2 + 1]);
        }
    }
    T query(int l, int r)
    { // get [l, r)
        T a = def, b = def;
        for (l += n, r += n; l < r; l /= 2, r /= 2)
        {
            if (l % 2)
                a = merge(a, seg[l++]);
            if (r % 2)
                b = merge(b, seg[--r]);
        }
        return merge(a, b);
    }
};

const ll MOD = 1e9 + 7;

template <class T>
void maxi(T &a, T b)
{
    a = max(a, b);
}

template <class T>
void mini(T &a, T b)
{
    a = min(a, b);
}

template <class T>
void addi(T &a, T b)
{
    a = (a + b) % MOD;
}

template <class T>
void subi(T &a, T b)
{
    a = (a - b + MOD) % MOD;
}

template <class T>
T add(T a, T b)
{
    return (a + b) % MOD;
}

template <class T>
T sub(T a, T b)
{
    return (a - b + MOD) % MOD;
}

template <class T>
T mul(T a, T b)
{
    return ((a % MOD) * (b % MOD)) % MOD;
}

ll binpow(ll a, ll b, ll mod)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
        {
            res = (res * a) % mod;
        }
        a = (a * a) % mod;
        b >>= 1;
    }

    return res;
}

struct DSU
{

    VI par;
    VI size;
    DSU(int _n) : par(_n), size(_n)
    {
        FOR(i, 0, _n)
        {
            par[i] = i;
            size[i] = 1;
        }
    }

    bool merge(int x, int y)
    {
        x = find(x);
        y = find(y);

        if (x == y)
            return false;
        if (size[y] > size[x])
            swap(x, y);
        size[x] += size[y];
        par[y] = x;
        return true;
    }

    int find(int x)
    {
        return (par[x] == x ? x : par[x] = find(par[x]));
    }

    bool connected(int x, int y)
    {
        return find(x) == find(y);
    }

    void reset()
    {
        FOR(i, 0, par.size())
        par[i] = i,
        size[i] = 1;
    }
};

const int INF = 1e9;
const int MAX_N = 1e3 + 4;

void solve()
{
    int n;
    cin >> n;

    VI p(n);
    FOR(i, 0, n)
    {
        cin >> p[i];
    }

    sort(ALL(p));
    p.erase(unique(ALL(p)), p.end());

    int mx = p.back();
    VI next(mx + 1, -1);
    FOR(i, 0, n)
    {
        next[p[i]] = i;
    }

    for (int i = mx - 1; i >= 0; i--)
    {
        if (next[i] == -1)
        {
            next[i] = next[i + 1];
        }
    }

    VV<PII> g(mx + 1);

    FOR(i, 0, n - 1)
    {
        g[p[i+1] % p[i]].PB({i, i + 1});
        for (int at = 2 * p[i]; at <= mx; at += p[i])
        {
            int tmp = next[at];
            g[p[tmp] % p[i]].PB({i, tmp});
        }
    }

    DSU dsu(mx + 1);
    ll ans = 0;
    FOR(i, 0, mx + 1) {
        for(auto &[a, b] : g[i]) {
            if(dsu.merge(a, b)) ans += i;
        }
    }

    cout << ans << LINE;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--)
        solve();
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 352336 KB Output is correct
2 Incorrect 217 ms 380496 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 856 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 163 ms 352596 KB Output is correct
2 Correct 169 ms 351824 KB Output is correct
3 Correct 173 ms 352592 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 49 ms 46216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 37724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 73 ms 57552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 11216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 228 ms 366676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 236 ms 370660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 184 ms 355044 KB Output isn't correct
2 Halted 0 ms 0 KB -