oj.uz

Submission #1106933

# Submission time Handle Problem Language Result Execution time Memory
1106933 2024-10-31T09:22:49 Z hoangnoobpro Sirni (COCI17_sirni) C++17
98 / 140
 2466 ms 786432 KB 
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define nmax 10000007
#define fi first
#define se second
#define ll int
ll t=1,n,m=0,i=0,j=0,d=0,x=0,k=0,y=0,z,a[nmax],f[10000003],h[10000003],cnt=0,pa[nmax],sz[nmax];
long long kq=0;
struct hm
{
    ll a,b,c;
}v[nmax];
bool cmp(hm a,hm b)
{
    return a.c<b.c;
}
ll findset(ll u)
{
    if(pa[u]==u)return u;
    return pa[u]=findset(pa[u]);
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(i=1;i<=n;++i)
    {
        cin>>a[i];
        x=max(x,a[i]);
        if(f[a[i]])
        {
            i--;
            n--;
            continue;
        }
        sz[i]=1;
        pa[i]=i;
        f[a[i]]=a[i];
    }
    sort(a+1,a+n+1);
    for(i=x;i>=1;--i)
    {
        if(!f[i])f[i]=f[i+1];
    }
    d=0;
    for(i=1;i<=x;++i)
    {
        if(f[i]!=f[i-1])d++;
        h[i]=d;
    }
    for(i=1;i<=n;++i)
    {
        for(j=a[i];j<=x;j+=a[i])
        {
            y=j;
            if(j==a[i])y++;
            if(y>x)break;
            if(f[y]<j+a[i])
            {
                v[++cnt].a=i;
                v[cnt].b=h[y];
                v[cnt].c=f[y]%a[i];
            }
        }
    }
    sort(v+1,v+cnt+1,cmp);
    kq=0;
    for(i=1;i<=cnt;++i)
    {
        x=findset(v[i].a);
        y=findset(v[i].b);
        if(x!=y)
        {
            if(sz[x]<sz[y])swap(x,y);
            sz[x]+=sz[y];
            pa[y]=x;
            kq+=v[i].c;
        }
    }
    cout<<kq;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 84408 KB Output is correct
2 Correct 72 ms 88648 KB Output is correct
3 Correct 44 ms 84528 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 186 ms 86744 KB Output is correct
3 Correct 47 ms 84680 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 84552 KB Output is correct
2 Correct 41 ms 84296 KB Output is correct
3 Correct 49 ms 84560 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 29008 KB Output is correct
2 Correct 262 ms 64052 KB Output is correct
3 Correct 106 ms 35116 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 18768 KB Output is correct
2 Correct 182 ms 43344 KB Output is correct
3 Correct 74 ms 25168 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 45384 KB Output is correct
2 Correct 337 ms 76268 KB Output is correct
3 Correct 109 ms 33104 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 13648 KB Output is correct
2 Correct 354 ms 72168 KB Output is correct
3 Correct 96 ms 33104 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 98900 KB Output is correct
2 Runtime error 2466 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 161 ms 99064 KB Output is correct
2 Runtime error 822 ms 635380 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 86640 KB Output is correct
2 Runtime error 769 ms 635448 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -