Submission #715387

# Submission time Handle Problem Language Result Execution time Memory
715387 2023-03-26T15:20:41 Z fuad27 Sirni (COCI17_sirni) C++17
84 / 140
1448 ms 786432 KB
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
struct DSU {
  vector<int> e;
  DSU(int N) {e = vector<int>(N, -1);}
  int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
  bool same_set(int a, int b) { return get(a) == get(b); }
  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;
  }
};
const int N=1e7+10;
int great[N];
vector<pair<int, pair<int,int>>> ed;
vector<int> v;
int main () {
  cin.tie(0)->sync_with_stdio(0);
  for(int i = 0;i<N;i++)great[i]=1e9;
  int n;
  cin >> n;
  {
    set<int> s;
    for(int i = 0;i<n;i++) {
      int a;
      cin >> a;
      s.insert(a);
    }
    v=vector<int>(s.begin(),s.end());
  }
  n=v.size();
  for(int i = 0;i<n;i++)great[v[i]]=i;
  for(int j = N-3;j>=0;j--) {
      great[j]=min(great[j],great[j+1]);
  }
  for(int i=0;i<n;i++) {
    for(int j=v[i];j<N-3;j+=v[i]) {
      if(j!=v[i]) {
        if(great[j]<n) {
          ed.push_back({v[great[j]]-j,{i,great[j]}});
        }
      }
      else if(great[j+1]<n) {
        ed.push_back({v[great[j+1]]-j,{i,great[j+1]}});
      }
    }
  }
  sort(ed.begin(),ed.end());
  DSU d(n+1);
  long long sum=0;
  for(auto i:ed) {
    sum+=(int)d.unite(i.second.first,i.second.second)*i.first;
  }
  cout << sum << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 22 ms 39636 KB Output is correct
2 Correct 436 ms 88844 KB Output is correct
3 Correct 26 ms 39980 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 71 ms 39664 KB Output is correct
2 Runtime error 770 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 23 ms 39636 KB Output is correct
2 Correct 24 ms 39520 KB Output is correct
3 Correct 28 ms 39768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 345 ms 68988 KB Output is correct
2 Correct 1010 ms 93236 KB Output is correct
3 Correct 504 ms 92516 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 64 ms 43264 KB Output is correct
2 Correct 587 ms 89160 KB Output is correct
3 Correct 396 ms 68076 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 607 ms 93484 KB Output is correct
2 Correct 1349 ms 142524 KB Output is correct
3 Correct 458 ms 68784 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 201 ms 47272 KB Output is correct
2 Correct 1448 ms 141608 KB Output is correct
3 Correct 468 ms 68232 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 278 ms 69056 KB Output is correct
2 Runtime error 894 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 370 ms 69212 KB Output is correct
2 Runtime error 898 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 58 ms 43460 KB Output is correct
2 Runtime error 1038 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -