oj.uz

Submission #1106884

# Submission time Handle Problem Language Result Execution time Memory
1106884 2024-10-31T08:34:37 Z vjudge1 Sirni (COCI17_sirni) C++17
140 / 140
 969 ms 754420 KB 
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
using namespace std;
using ll = long long;
const int nx=1e5+5;
const int N=1e7+5;
int n, a[N], last[N], par[N];
ll ans=0;
vector<int> rar;
vector<ii> ed[N];
int find(int u)
{
    if(!par[u])
        return u;
    return par[u]=find(par[u]);
}
bool join(int u, int v)
{
    u=find(u);
    v=find(v);
    if(u==v)
        return 0;
    par[v]=u;
    return 1;
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i = 1; i <= n; i++)
        cin>>a[i], rar.emplace_back(a[i]);
    sort(rar.begin(), rar.end());
    rar.erase(unique(rar.begin(), rar.end()), rar.end());
    n=rar.size();
    for(int i = 1; i <= n; i++)
    {
        a[i]=rar[i-1];
        last[a[i]]=i;
    }
    for(int i = N-2; i >= 1; i--)
    {
        if(last[i])
            continue;
        if(last[i+1])
            last[i]=last[i+1];
    }
    for(int i = 1; i <= n; i++)
    {
        if(last[a[i]+1])
            ed[a[last[a[i]+1]]%a[i]].emplace_back(i, last[a[i]+1]);
        for(int j = 2*a[i]; j <= a[n]; j+=a[i])
            if(last[j])
                ed[a[last[j]]%a[i]].emplace_back(i, last[j]);
    }
    for(int i = 0; i < N; i++)
        for(auto it:ed[i])
            if(join(it.fi, it.se))
                ans+=i;
    cout<<ans;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 277576 KB Output is correct
2 Correct 109 ms 306836 KB Output is correct
3 Correct 61 ms 278060 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 240760 KB Output is correct
2 Correct 621 ms 676324 KB Output is correct
3 Correct 75 ms 278344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 277764 KB Output is correct
2 Correct 64 ms 277580 KB Output is correct
3 Correct 60 ms 277836 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 254904 KB Output is correct
2 Correct 128 ms 290380 KB Output is correct
3 Correct 97 ms 267192 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 246804 KB Output is correct
2 Correct 117 ms 267932 KB Output is correct
3 Correct 86 ms 253616 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 271168 KB Output is correct
2 Correct 146 ms 308828 KB Output is correct
3 Correct 115 ms 265760 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 244200 KB Output is correct
2 Correct 164 ms 303768 KB Output is correct
3 Correct 99 ms 268324 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 290660 KB Output is correct
2 Correct 730 ms 636992 KB Output is correct
3 Correct 124 ms 294600 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 295228 KB Output is correct
2 Correct 969 ms 754420 KB Output is correct
3 Correct 188 ms 353060 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 279880 KB Output is correct
2 Correct 897 ms 639736 KB Output is correct
3 Correct 107 ms 273304 KB Output is correct