oj.uz

Submission #1004253

# Submission time Handle Problem Language Result Execution time Memory
1004253 2024-06-21T06:50:18 Z Huseyn123 Sirni (COCI17_sirni) C++17
0 / 140
 337 ms 73912 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
  #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define int ll
#define MAX 100001
#define INF INT_MAX
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second 

#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define outputar(a,b){\
    for(int i=0;i<b;i++){\
        cout << a[i] << " ";\
    }\
    cout << endl;\
}
#define outputvec(a){\
    for(auto x:a){\
        cout << (int)x << " ";\
    }\
    cout << endl;\
}
#define reset(a,n,v){\
    for(int i=0;i<n;i++){\
        a[i]=v;\
    }\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
  freopen((filename+".in").c_str(),"r",stdin);
  freopen((filename+".out").c_str(),"w",stdout);
}
int n,q,t=1,m,k,x,y,z,x2,y2,z2,a[MAX],b[MAX],d[MAX],e[MAX];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
string s[MAX],str[MAX];
//int e[1001][1001];
string s1,s2,s3;
const int mod = 998244353;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
struct DSU{
    vector<int> e;
    DSU(int N){ e=vector<int>(N+1,-1);}
    int get(int x){return e[x]<0 ? x : e[x]=get(e[x]);}
    bool same_set(int x,int y){ return get(x)==get(y);}
    int size(int x){return -e[get(x)];}
    bool unite(int x,int y){
        x=get(x);
        y=get(y);
        if(x==y) return false;
        if(e[x]>e[y]) swap(x,y);
        e[x]+=e[y]; e[y]=x;
        return true;
    }
};
void solve(){
    cin >> n; 
    int mx=0;
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    sort(a,a+n);
    mx=a[n-1];
    vector<pii> c;
    for(int i=0;i<n;i++){
        for(int j=a[i];j<=mx;j+=a[i]){
            c.pb({j,i});
        }
    }
    sortv(c);
    vector<array<int,3>> edges; 
    for(int i=1;i<n;i++){
        array<int,3> h;
        pii p={a[i],INF};
        auto it=ub(c,p);
        --it;
        pii p1=*it;
        if(p1.ss==i){
            --it;
            p1=*it;
        }
        while(true){
            p=*it;
            if(p1.ff==p.ff){
                edges.pb({a[i]-p.ff,i,p.ss});
            }
            else{
                break;
            }
            if(it==c.begin()){
                break;
            }
            --it;
        }
    }
    DSU dsu(n);
    sortv(edges);
    int res=0;
    for(auto x:edges){
        if(dsu.unite(x[1],x[2])){
            res+=x[0];
        }
    }
    cout << res << "\n";
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //freopen("input13.txt","r",stdin);
    //cin >> t;
    ll cnt1=1;
    while(t--){
        solve();
        cnt1++; 
    }
}

Compilation message

sirni.cpp: In function 'void solve()':
sirni.cpp:88:22: warning: unused variable 'h' [-Wunused-variable]
   88 |         array<int,3> h;
      |                      ^

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 7000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 147 ms 41164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 10960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 337 ms 73912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 19340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 128 ms 41152 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 43136 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 11236 KB Output isn't correct
2 Halted 0 ms 0 KB -