Submission #715379

# Submission time Handle Problem Language Result Execution time Memory
715379 2023-03-26T15:08:49 Z fuad27 Sirni (COCI17_sirni) C++17
84 / 140
1391 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;
vector<int> great(N,1e9);
vector<pair<long long, pair<int,int>>> ed;
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> v;
  {
    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 28 ms 39628 KB Output is correct
2 Correct 403 ms 105220 KB Output is correct
3 Correct 27 ms 40180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 70 ms 39724 KB Output is correct
2 Runtime error 806 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 26 ms 39644 KB Output is correct
2 Correct 25 ms 39548 KB Output is correct
3 Correct 25 ms 39892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 311 ms 77088 KB Output is correct
2 Correct 1010 ms 109472 KB Output is correct
3 Correct 506 ms 109016 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 72 ms 44260 KB Output is correct
2 Correct 556 ms 105516 KB Output is correct
3 Correct 387 ms 76192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 622 ms 109872 KB Output is correct
2 Correct 1333 ms 175420 KB Output is correct
3 Correct 445 ms 76916 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 216 ms 49352 KB Output is correct
2 Correct 1391 ms 174452 KB Output is correct
3 Correct 470 ms 76432 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 294 ms 77328 KB Output is correct
2 Runtime error 866 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 352 ms 77372 KB Output is correct
2 Runtime error 861 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 58 ms 44532 KB Output is correct
2 Runtime error 993 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -