oj.uz

Submission #715386

# Submission time Handle Problem Language Result Execution time Memory
715386 2023-03-26T15:19:59 Z fuad27 Sirni (COCI17_sirni) C++17
84 / 140
 1429 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<int, pair<int,int>>> ed;
vector<int> v;
int main () {
  cin.tie(0)->sync_with_stdio(0);
  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";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 39636 KB Output is correct
2 Correct 421 ms 88864 KB Output is correct
3 Correct 29 ms 39980 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 39632 KB Output is correct
2 Runtime error 805 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 39636 KB Output is correct
2 Correct 25 ms 39508 KB Output is correct
3 Correct 34 ms 39760 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 68884 KB Output is correct
2 Correct 1039 ms 93128 KB Output is correct
3 Correct 507 ms 92588 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 43144 KB Output is correct
2 Correct 606 ms 89152 KB Output is correct
3 Correct 441 ms 68052 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 644 ms 93552 KB Output is correct
2 Correct 1413 ms 142616 KB Output is correct
3 Correct 499 ms 68756 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 47420 KB Output is correct
2 Correct 1429 ms 141636 KB Output is correct
3 Correct 531 ms 68288 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 69152 KB Output is correct
2 Runtime error 909 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 69168 KB Output is correct
2 Runtime error 1008 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 43536 KB Output is correct
2 Runtime error 1092 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -