제출 #1131912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131912		steveonalex	Sirni (COCI17_sirni)	C++20	140 / 140	1454 ms	575804 KiB

sirni

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 1; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}

    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }

    int get_size(int u){return sz[find_set(u)];}
};

const int N = 1e7 + 69, INF = 1e9 + 69;
int nxt[N];
vector<pair<int, int>> e[N];

void solve(){
    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i) cin >> a[i];

    remove_dup(a);

    if (a[0] == 1){
        cout << 0 << "\n";
        return;
    }

    n = a.size();

    for(int i= 0; i < N; ++i) nxt[i] = -1;
    for(int i = 0; i < n; ++i) nxt[a[i]] = i;
    for(int i = N - 2; i >= 0; --i) if (nxt[i] == -1)
        nxt[i] = nxt[i+1];

    DSU mst(n);
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < N; j += a[i]){
            if (nxt[j] == -1) break;
            if (a[nxt[j]] == j) 
                mst.join_set(nxt[j], i);
        }
        for(int j = 1; j < N; j += a[i]){
            if (nxt[j] == -1) break;
            int w = a[nxt[j]] - j + 1;
            if (w < a[i])
                e[w].push_back({i, nxt[j]});
        }
    }

    int ans = 0;
    for(int i = 0; i < N; ++i) for(pair<int, int> j: e[i]) 
        if (mst.join_set(j.first, j.second))
            ans += i;

    cout << ans << "\n"; 
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

• 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