oj.uz

답안 #949284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949284 2024-03-19T04:55:53 Z vjudge1 Sirni (COCI17_sirni) C++17
42 / 140
 584 ms 786432 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>*/
template<class S,class T>
bool chmin(S &a,const T &b) {
	return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
	return a<b?(a=b)==b:false;
}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll N=1e5+5;
const ll M=1e7+5;
ll siz[N],p[N];
vll v(1);
ll anc(ll a){
    return (a==p[a] ? a : p[a]=anc(p[a]));
}
bool uni(ll a,ll b){
    a=anc(a);
    b=anc(b);
    if(a==b) return false;
    if(siz[a]>siz[b])swap(a,b);
    siz[b]+=siz[a];
    p[a]=b;
    return true;
}
void solve(){
    ll i,j;
    ll n,sum=0;
    cin>>n;
    ll a;
    set<ll> st;
    for(i=0;i<n;i++){
        cin>>a;
        p[i+1]=i+1;
        siz[i+1]=1;
        st.ins(a);
    }
    n=st.sz;
    for(auto i : st) v.pb(i);
    vector<pair<ll,pair<ll,ll>>> e;
    for(i=1;i<=n;i++){
        for(j=i+1;j<=n;j++){
            e.pb({v[j]%v[i],{i,j}});
        }
    }
    sort(all(e));
    ll c=n-1,ans=0;
    for(i=0;i<e.sz;i++){
        if(uni(e[i].sc.fr,e[i].sc.sc)){c--;ans+=e[i].fr;}
        if(!c) break;
    }
    cout<<ans<<endl;
}
signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*




*/

Compilation message

sirni.cpp: In function 'void solve()':
sirni.cpp:78:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(i=0;i<e.sz;i++){
      |              ^
sirni.cpp:58:10: warning: unused variable 'sum' [-Wunused-variable]
   58 |     ll n,sum=0;
      |          ^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 14792 KB Output is correct
2 Correct 39 ms 13256 KB Output is correct
3 Correct 41 ms 14280 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 14792 KB Output is correct
2 Correct 27 ms 7116 KB Output is correct
3 Correct 43 ms 14280 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 13260 KB Output is correct
2 Correct 33 ms 14792 KB Output is correct
3 Correct 41 ms 14540 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 504 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 504 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 488 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 467 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 584 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 485 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 473 ms 786432 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -