Submission #1193357

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193357		zyadhany	Sirni (COCI17_sirni)	C++20	14 / 140	295 ms	77184 KiB

sirni

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

#define ll int
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "-1\n"; return;}

const int MODE = 1e9 + 7;

using namespace std;

const int MXN = 1e5+10;
int PAR[MXN], R[MXN];

ll get(ll n) {
    if (n == PAR[n]) return n;
    return PAR[n]=get(PAR[n]); 
}

bool add(ll u, ll v) {
    u = get(u), v = get(v);
    if (u == v) return 0;
    if (R[v] > R[u]) swap(u,v);
    R[u] += (R[v] == R[u]);
    PAR[v] = u;
    return 1;
}

void INIT() {
    for (int i = 0; i < MXN; i++)
    {
        PAR[i] = i;
        R[i] = 0;
    }
    
}

int frq[(int)1e7+1]={0};

void solve(int tc) {
    ll n;

    cin >> n;

    vi X(n);

    for (int i = 0; i < n; i++)
    {
        cin >> X[i];
    }
    set st(all(X));
    X.assign(all(st));
    for (int i = 0; i < n; i++)
    {
        frq[X[i]] = i+1;
    }
    
    for (int i = 1e7 - 1; i >= 1; i--)
    {
        if (frq[i] == 0) frq[i] = frq[i+1];
    }
    

    n = X.size();
    vp E;
    for (int i = 0; i < n; i++)
    {
        if (i && X[i] < X[i-1] * 2) {
            E.push_back({i-1,i});
        }
        for (int j = 2*X[i]; j <= X.back(); j+=X[i])
        {
            ll re = frq[j]-1;
            if ( X[re] < j + X[i]) {
                E.push_back({i, re});
            }
        }
    }
    sort(E.begin(), E.end(), [&](pl &a, pl &b) {
        return (X[a.second]%X[a.first]) < (X[b.second]%X[b.first]);
    });
    INIT();
    ll res = 0;
    for (auto e : E) {
        if (add(e.first, e.second)) res += X[e.second]%X[e.first];
    }
    cout << res << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int size = 1;

    // freopen("math.in", "r", stdin);
    //freopen("output.txt", "w", stdout);

    // cin >> size;
    for (int i = 1; i <= size; i++)
        solve(i);
}

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