oj.uz

Submission #248211

# Submission time Handle Problem Language Result Execution time Memory
248211 2020-07-12T08:39:39 Z leaked Sirni (COCI17_sirni) C++14
126 / 140
 5000 ms 241640 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e6+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
int p[N],sz[N],a[N];
vector<int>is[(int)1e7+1];
int get_p(int v) {
    return (v==p[v] ? v : p[v]=get_p(p[v]));
}
bool mg(int a,int b){
    int ra=get_p(a),rb=get_p(b);
    if(ra!=rb){
        if(sz[rb]>sz[ra]) swap(ra,rb);
        p[rb]=ra;
        sz[ra]+=sz[rb];
    }
}
signed main()
{
    fast_io;
    int n;
    cin>>n;
    iota(p,p+n,0);
    vector<pair<int,pii>>e;
    for(int i=0;i<n;i++){
        cin>>a[i];
        sz[i]=1;
    }
    sort(a,a+n);
    if(n<=1000){
        for(int i=0;i<n;i++){
            for(int j=0;j<i;j++){
                e.p_b({min(a[i]%a[j],a[j]%a[i]),{i,j}});
            }
        }
        sort(all(e));
        ll ans=0;
        for(auto &z : e){
            int v=z.s.f,u=z.s.s;
            if(get_p(v)!=get_p(u)){
                mg(v,u);
                ans+=z.f;
            }
        }
        cout<<ans;
        exit(0);
    }
    for(int i=0;i<n;i++){
        is[a[i]].p_b(i);
    }
    int cnt=0;
    ll ans=0;
    for(int i=0;i<a[0] && cnt!=n-1;i++){
        for(int k=0;k<n && cnt!=n-1;k++){
            for(int t=i;t<=a[n-1] && cnt!=n-1;t+=a[k]){
                if(!sz(is[t]))continue;
                for(auto &z : is[t]){
                    if(get_p(z)!=get_p(k)){
                        cnt++;
                        ans+=i;
                        mg(z,k);
                    }
                }
            }
        }
    }
    cout<<ans;
    return 0;
}
/*
    4 4
    1 2 a
    3 2 a
    1 4 a
    3 4 b




*/

Compilation message

sirni.cpp: In function 'bool mg(int, int)':
sirni.cpp:92:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 241512 KB Output is correct
2 Correct 190 ms 241516 KB Output is correct
3 Correct 177 ms 241512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 241512 KB Output is correct
2 Correct 191 ms 241512 KB Output is correct
3 Correct 183 ms 241640 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 241512 KB Output is correct
2 Correct 168 ms 241512 KB Output is correct
3 Correct 190 ms 241512 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 240100 KB Output is correct
2 Correct 659 ms 239704 KB Output is correct
3 Correct 186 ms 239480 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 236024 KB Output is correct
2 Correct 1150 ms 237604 KB Output is correct
3 Correct 295 ms 238732 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 589 ms 239352 KB Output is correct
2 Correct 307 ms 239224 KB Output is correct
3 Correct 190 ms 239224 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 236792 KB Output is correct
2 Correct 420 ms 238800 KB Output is correct
3 Correct 190 ms 239096 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1522 ms 239524 KB Output is correct
2 Correct 730 ms 239484 KB Output is correct
3 Correct 1552 ms 239500 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 239532 KB Output is correct
2 Correct 2980 ms 238912 KB Output is correct
3 Correct 241 ms 239280 KB Output is correct

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1587 ms 236108 KB Output is correct
2 Execution timed out 5067 ms 238584 KB Time limit exceeded
3 Halted 0 ms 0 KB -