제출 #649655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
649655		mychecksedad	Sirni (COCI17_sirni)	C++17	42 / 140	88 ms	6596 KiB

sirni

/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

struct Dsu {
    vector<int> s, p;
    Dsu(int n){
        s.resize(n+1, 1);
        p.resize(n+1);
        for(int i = 0; i <= n; ++i) p[i] = i;
    }
    int find(int v){
        if(p[v] == v) return v;
        return (p[v] = find(p[v]));
    }
    void merge(int a, int b){
        a = find(a);
        b = find(b);
        if(a != b){
            if(s[a] > s[b]){
                swap(a, b);
            }
            s[b] += s[a];
            p[a] = b;
        }
    }
};

int n, a[N];
void solve(){
    cin >> n;
    for(int i = 0; i < n; ++i) cin >> a[i + 1];
    Dsu d(n);
    if(n <= 1000){
        vector<array<int, 3>> edges;
        for(int i = 1; i <= n; ++i) for(int j = i + 1; j <= n; ++j) edges.pb({min(a[i]%a[j], a[j]%a[i]), i, j});
        sort(all(edges));
        int ans = 0;
        for(auto v: edges){
            if(d.find(v[1]) != d.find(v[2])){
                d.merge(v[1], v[2]);
                ans += v[0];
            }
        }
        cout << ans;
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

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

sirni.cpp: In function 'int main()':
sirni.cpp:67:16: warning: unused variable 'aa' [-Wunused-variable]
   67 |     int T = 1, aa;
      |                ^~

• 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