oj.uz

Submission #156062

# Submission time Handle Problem Language Result Execution time Memory
156062 2019-10-03T06:15:11 Z ionanghelina Sirni (COCI17_sirni) C++14
112 / 140
 5000 ms 395728 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxN=(1e5)+5;
const int maxV=(1e7)+5;
const int inf=INT_MAX;

struct tip
{
    int x,y,cost;

    bool operator<(const tip& other)
    {
        return cost<other.cost;
    }
};

class dsu
{
    private:
        int t[maxN];
    public:

        dsu(int n)
        {
            for(int i=1;i<=n;i++)
                t[i]=-1;
        }

        inline int getRoot(int x)
        {
            //getting the root
            int y=x;

            while(t[y]>0) y=t[y];

            //road compression
            int z=y;

            y=x;

            while(y!=z)
            {
                int aux=t[y];
                t[y]=z;
                y=aux;
            }

            return y;
        }

        inline void unite(int x,int y)
        {
            int tx=getRoot(x);
            int ty=getRoot(y);
            if(tx<ty)
            {
                t[tx]+=t[ty];
                t[ty]=tx;
            }
                else
            {
                t[ty]+=t[tx];
                t[tx]=ty;
            }
        }
};

vector<tip> edges;

int n,v[maxN],cnt,M[maxV],nrm[maxN],x,y,cst,tx,ty;
long long sol;


inline int cost(int x,int y)
{
    int xa,ya;

    xa=M[x];
    ya=M[y];
    return min((xa%ya),(ya%xa));

}
int taken=0;

int main()
{
   // freopen("sirni.in","r",stdin);
   // freopen("sirni.out","w",stdout);

    scanf("%d",&n);

    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);

    sort(v+1,v+n+1);

    v[n+1]=inf;

    for(int i=1;i<=n;i++)
    {
        if(i==1 || v[i]!=v[i-1]) cnt++;
        M[cnt]=v[i];
        nrm[i]=cnt;
    }


    for(int i=1;i<=cnt;i++)
    {
        int x=M[i];
        if(x>=v[n]) continue;

        int ind=upper_bound(v+1,v+n+1,x)-v;



        edges.push_back({i,nrm[ind],cost(i,nrm[ind])});
        int lst=nrm[ind];

        for(int j=x+x;j<=v[n];j+=x)
        {
            if(j>v[n]) continue;

            ind=lower_bound(v+1,v+n+1,j)-v;

            if(nrm[ind]!=lst) edges.push_back({i,nrm[ind],cost(i,nrm[ind])});
            lst=nrm[ind];
        }
    }



    sort(edges.begin(),edges.end());

    //for(auto it:edges)
      //  printf("%d %d% d\n",it.x,it.y,it.cost);

    dsu D=dsu(n);


    for(auto it:edges)
    {
        if(taken==cnt-1) break;
        x=it.x;
        y=it.y;
        cst=it.cost;

        tx=D.getRoot(x);
        ty=D.getRoot(y);

        if(tx!=ty)
        {
            taken++;
            sol+=1LL*cst;
            D.unite(tx,ty);
        }
    }


    printf("%lld\n",sol);

    return 0;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:91:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
sirni.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&v[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 89 ms 3660 KB Output is correct
3 Correct 5 ms 632 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 852 ms 1352 KB Output is correct
3 Correct 5 ms 696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 504 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 13956 KB Output is correct
2 Correct 756 ms 50852 KB Output is correct
3 Correct 320 ms 26128 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3692 KB Output is correct
2 Correct 419 ms 50588 KB Output is correct
3 Correct 216 ms 14100 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 51060 KB Output is correct
2 Correct 1016 ms 100224 KB Output is correct
3 Correct 298 ms 26356 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 7164 KB Output is correct
2 Correct 974 ms 100004 KB Output is correct
3 Correct 295 ms 26200 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 26280 KB Output is correct
2 Correct 4837 ms 395728 KB Output is correct
3 Correct 331 ms 27080 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 26212 KB Output is correct
2 Execution timed out 5101 ms 395700 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 3948 KB Output is correct
2 Execution timed out 5058 ms 395600 KB Time limit exceeded
3 Halted 0 ms 0 KB -