oj.uz

Submission #1106862

# Submission time Handle Problem Language Result Execution time Memory
1106862 2024-10-31T08:09:21 Z vjudge1 Sirni (COCI17_sirni) C++14
84 / 140
 910 ms 786432 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=2e7+5;
int n, a[nx], last[N], par[nx];
ll ans=0;
vector<int> rar;
vector<pair<int, ii>> ed;
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.push_back({a[last[a[i]+1]]%a[i], {i, last[a[i]+1]}});
        for(int j = 2*a[i]; j < N; j+=a[i])
            if(last[j])
                ed.push_back({a[last[j]]%a[i], {i, last[j]}});
    }
    sort(ed.begin(), ed.end());
    for(auto it:ed)
        if(join(it.se.fi, it.se.se))
            ans+=it.fi;
    cout<<ans;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 41552 KB Output is correct
2 Correct 217 ms 92844 KB Output is correct
3 Correct 20 ms 42000 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2640 KB Output is correct
2 Runtime error 596 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 41552 KB Output is correct
2 Correct 22 ms 41432 KB Output is correct
3 Correct 19 ms 41808 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 34616 KB Output is correct
2 Correct 650 ms 59172 KB Output is correct
3 Correct 299 ms 59180 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 10484 KB Output is correct
2 Correct 337 ms 59168 KB Output is correct
3 Correct 197 ms 32280 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 59064 KB Output is correct
2 Correct 910 ms 108248 KB Output is correct
3 Correct 267 ms 34604 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 10120 KB Output is correct
2 Correct 901 ms 108308 KB Output is correct
3 Correct 273 ms 34612 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 69372 KB Output is correct
2 Runtime error 658 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 69428 KB Output is correct
2 Runtime error 665 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 45316 KB Output is correct
2 Runtime error 685 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -