제출 #555325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555325		stefantaga	Sirni (COCI17_sirni)	C++14	0 / 140	729 ms	297896 KiB

sirni

#include <bits/stdc++.h>

using namespace std;
int fr[10000005],n,x,i,tata[1000005],rang[1000005];
set <pair <int,int>> m;
vector <pair <int,int>> bonjour[10000005];
int costul(int a,int b)
{
    return min (a%b,b%a);
}
int parinte (int x)
{
    if (x!=tata[x])
    {
        return tata[x]=parinte(tata[x]);
    }
    return x;
}
void uneste(int x,int y)
{
    x=parinte(x);
    y=parinte(y);
    if (rang[x]<rang[y])
    {
        tata[x]=y;
    }
    else
    if (rang[y]<rang[x])
    {
        tata[y]=x;
    }
    else
    {
        tata[x]=y;
        rang[y]++;
    }
}
int v[100005],q,maxim;
int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n;
    for (i=1;i<=n;i++)
    {
        cin>>x;
        if (fr[x]==0)
        {
            fr[x]=1;
            v[++q]=x;
        }
        maxim=max(maxim,x);
    }
    n=q;
    for (i=1;i<=n;i++)
    {
        m.insert({v[i],i});
    }
    for (i=1;i<=n;i++)
    {
        for (int j=1;j*v[i]<=maxim;j++)
        {
            auto ceau = m.lower_bound({j*v[i],1});
            if (ceau == m.end())
            {
                break;
            }
            pair <int,int> Locas = (*ceau);
            bonjour[costul(Locas.first,v[i])].push_back({i,Locas.second});
        }
    }
    for (i=1;i<=n;i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    long long sum=0;
    for (i=0;i<=maxim;i++)
    {
        for (int j=0;j<bonjour[i].size();j++)
        {
            int x = bonjour[i][j].first;
            int y =bonjour[i][j].second;
            if (parinte(x)!=parinte(y))
            {
                sum=sum+i;
                uneste(x,y);
            }
        }
    }
    cout<<sum;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'int main()':
sirni.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for (int j=0;j<bonjour[i].size();j++)
      |                      ~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 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