oj.uz

Submission #1061663

# Submission time Handle Problem Language Result Execution time Memory
1061663 2024-08-16T11:33:14 Z dimasnbayu Sirni (COCI17_sirni) C++14
98 / 140
 1106 ms 786432 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int sz=1e5+5;
int par[sz],nx[10000005],av[10000005];
vector<int> arr;
vector<pair<int,pair<int,int>>> v;
int find(int x){
    if(par[x]==x) return x;
    else return par[x]=find(par[x]);
}
void merge(int x, int y){
    x=find(x),y=find(y);
    par[x]=y;
}
bool check(int x, int y){
    return find(x)==find(y);
}
signed main(){
    int n; cin>>n;
    for(int i=1;i<=n;i++){
        int a; cin>>a;
        arr.push_back(a);
    }
    sort(arr.begin(),arr.end());
    arr.erase(unique(arr.begin(),arr.end()), arr.end());
    // sort(arr.begin(),arr.end());
    for(int i=0;i<arr.size();i++){
        par[i]=i;
        av[arr[i]]=i;
    }
    int now=0;
    for(int i=0;i<=arr.back();i++){
        while(now+1<arr.size() && arr[now]<=i) now++;
        nx[i]=now;
        // cout<<nx[i]<<" ";
    }
    // cout<<endl;
    for(int i=0;i<arr.size();i++){
        // cout<<arr[i]<<" ";
        for(int j=arr[i];j<=arr.back();j+=arr[i]){
            if(i==nx[j]) continue;
            if(v.size()==0 || ((v.back().second.first!=i || v.back().second.second!=nx[j]))) v.push_back({arr[nx[j]]%arr[i],{i,nx[j]}});
            if(arr[av[j]]%arr[i]==0) v.push_back({0,{i,av[j]}});
        }
    }
    // cout<<endl;
    sort(v.begin(),v.end());
    int ans=0;
    for(int i=0;i<v.size();i++){
        // cout<<v[i].first<<" "<<v[i].second.first<<" "<<v[i].second.second<<endl;
        if(!check(v[i].second.first,v[i].second.second)){
            ans+=v[i].first;
            merge(v[i].second.first,v[i].second.second);
        }
    }
    cout<<ans;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:28:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i=0;i<arr.size();i++){
      |                 ~^~~~~~~~~~~
sirni.cpp:34:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         while(now+1<arr.size() && arr[now]<=i) now++;
      |               ~~~~~^~~~~~~~~~~
sirni.cpp:39:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<arr.size();i++){
      |                 ~^~~~~~~~~~~
sirni.cpp:50:18: 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]
   50 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 157052 KB Output is correct
2 Correct 80 ms 162636 KB Output is correct
3 Correct 35 ms 157268 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3104 KB Output is correct
2 Correct 1106 ms 548560 KB Output is correct
3 Correct 43 ms 159948 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 157012 KB Output is correct
2 Correct 27 ms 134260 KB Output is correct
3 Correct 35 ms 157264 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 69296 KB Output is correct
2 Correct 668 ms 217084 KB Output is correct
3 Correct 297 ms 119676 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 24248 KB Output is correct
2 Correct 292 ms 119160 KB Output is correct
3 Correct 190 ms 62636 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 119208 KB Output is correct
2 Correct 864 ms 217672 KB Output is correct
3 Correct 322 ms 118944 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 19008 KB Output is correct
2 Correct 782 ms 218224 KB Output is correct
3 Correct 286 ms 119460 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 209048 KB Output is correct
2 Runtime error 706 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 258364 KB Output is correct
2 Runtime error 820 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 163648 KB Output is correct
2 Runtime error 768 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -