oj.uz

Submission #248385

# Submission time Handle Problem Language Result Execution time Memory
248385 2020-07-12T10:37:05 Z leaked Sirni (COCI17_sirni) C++14
140 / 140
 4269 ms 684376 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(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << 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<pii>to[(int)1e7];
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;
  //  freopen("out3.txt","w",stdout);
    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);
    int cnt=0;
    ll ans=0;
    for(int i=0;i<n;i++){
        int j=0;
//        if(a[i]!=2088763) continue;
          //   cout<<a[i]<<' ';
        if(i+1<n) to[a[i+1]-a[i]].p_b({i,i+1});
        while(1){
            int f=lower_bound(a,a+n,j)-a;
            if(f==n)break;
//            if(f>0){
//                to[(a[f-1]%a[i])].p_b({f-1,i});
//            }
            to[(a[f]%a[i])].p_b({f,i});
            j=(a[f]/a[i]+1)*a[i];
        }
    }
    for(int i=0;i<1e7 && cnt!=n-1;i++){
        for(auto &z : to[i]){
            if(get_p(z.f)!=get_p(z.s)){
                mg(z.f,z.s);
                ans+=i;
                cnt++;
             //   debug()<<imie(i)<<' '<<imie(a[z.f])<<imie(a[z.s]);
            }
        }
    }
    /// x%a=1 y%a=2
    /// y%a=
    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 127 ms 235332 KB Output is correct
2 Correct 131 ms 238132 KB Output is correct
3 Correct 118 ms 235568 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 235272 KB Output is correct
2 Correct 136 ms 236256 KB Output is correct
3 Correct 123 ms 235384 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 235384 KB Output is correct
2 Correct 124 ms 235256 KB Output is correct
3 Correct 118 ms 235384 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 248612 KB Output is correct
2 Correct 713 ms 286592 KB Output is correct
3 Correct 368 ms 261088 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 237432 KB Output is correct
2 Correct 2069 ms 505344 KB Output is correct
3 Correct 280 ms 250616 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 263288 KB Output is correct
2 Correct 981 ms 314624 KB Output is correct
3 Correct 288 ms 252632 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 239828 KB Output is correct
2 Correct 808 ms 307124 KB Output is correct
3 Correct 325 ms 257160 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 249956 KB Output is correct
2 Correct 2894 ms 536092 KB Output is correct
3 Correct 312 ms 253208 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 249912 KB Output is correct
2 Correct 4225 ms 649260 KB Output is correct
3 Correct 354 ms 260748 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 238068 KB Output is correct
2 Correct 4269 ms 684376 KB Output is correct
3 Correct 337 ms 259804 KB Output is correct