Submission #715189

#	Time	Username	Problem	Language	Result	Execution time	Memory
715189		Khizri	Sirni (COCI17_sirni)	C++17	42 / 140	949 ms	786432 KiB

sirni

#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);

    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,arr[mxn],sz[mxn],p[mxn];
int fnd(int u){
    if(p[u]==u) return u;
    return p[u]=fnd(p[u]);
}
void Union(int u,int v){
    if(fnd(u)!=fnd(v)){
        u=fnd(u);
        v=fnd(v);
        if(sz[v]>sz[u]){
            swap(u,v);
        }
        sz[u]+=sz[v];
        p[v]=u;
    }
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    vector<pair<int,pii>>vt;
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            vt.pb({min(arr[i]%arr[j],arr[j]%arr[i]),{i,j}});
        }
    }
    for(int i=1;i<=n;i++){
        p[i]=i;
        sz[i]=1;
    }
    sort(all(vt));
    ll ans=0;
    for(int i=0;i<vt.size();i++){
        int k=vt[i].F,u=vt[i].S.F,v=vt[i].S.S;
        if(fnd(u)!=fnd(v)){
            Union(u,v);
            ans+=k;
        }
    }
    cout<<ans<<endl;
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Compilation message (stderr)

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

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