Submission #1167498

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167498		ByeWorld	Sirni (COCI17_sirni)	C++20	42 / 140	944 ms	851968 KiB

sirni

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<int,pii> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 3e5+10;
const int MAXA = 1e7+10;
const int INF = 1e9+10;
const int SQRT = 300;
const int LOG = 20;
const ld EPS = 1e-6;
const int MOD = 1e9+7;
int sum(int a, int b){ return (a+b)%MOD; }
void chsum(int &a, int b){ a = (a+b)%MOD; }
void chsub(int &a, int b){ a = (a+MOD-b)%MOD; }
int mul(int a, int b){ return (a*b)%MOD; }
void chmul(int &a, int b){ a = (a*b)%MOD; }
void chmn(int &a, int b){ a = min(a, b); }
void chmx(int &a, int b){ a = max(a, b); }
int expo(int a, int b){
    if(b==0) return 1;
    int te = expo(a, b/2); te = mul(te,te);
    return (b%2 ? mul(te,a) : te);
}

int n, a[MAXN];
vector <ipii> edge;
struct dsu {
    int par[MAXN];
    void bd(){
        for(int i=1; i<=n; i++) par[i] = i;
    }
    int f(int x){
        return (par[x]==x ? x : par[x]=f(par[x]));
    }
    bool con(int x, int y){ return f(x) == f(y); }
    void mer(int x, int y){
        x = f(x); y = f(y); par[x] = y;
    }
} DSU;
signed 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];
    int ans = 0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(i==j) continue;
            int oth = max(a[i], a[j]) % min(a[i], a[j]);
            edge.pb({oth, {i,j}});
        }
    }
    DSU.bd();
    sort(edge.begin(), edge.end());
    for(auto [wei, in] : edge){
        if(DSU.f(in.fi) == DSU.f(in.se)) continue;
        ans += wei; DSU.mer(in.fi, in.se);
    }
    cout << ans << '\n';
}

• 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