oj.uz

Submission #715409

# Submission time Handle Problem Language Result Execution time Memory
715409 2023-03-26T15:54:14 Z fuad27 Sirni (COCI17_sirni) C++17
140 / 140
 3763 ms 708600 KB 
#include<bits/stdc++.h>
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,int>> ed[N/2];
vector<int> v;
DSU d(1e5+10);
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  v.resize(n);
  {
    for(int i = 0;i<n;i++) {
      cin >> v[i];
    }
    sort(v.begin(), v.end() );
    v.erase( unique( v.begin(), v.end() ), v.end() );
  }
  n=v.size();
  for(int i = 0;i<n;i++)great[v[i]]=i;
  for(int j =v[n-1];j>=0;j--) {
      great[j]=min(great[j],great[j+1]);
  }
  for(int i=0;i<n;i++) {
    for(int j=v[i];j<=v[n-1];j+=v[i]) {
      if(j!=v[i]) {
        if(great[j]<n) {
          if(v[great[j]]-j>=N/2)continue;
          ed[v[great[j]]-j].push_back({i,great[j]});
        }
      }
      else if(great[j+1]<n) {
        if(v[great[j+1]]-j>=N/2)continue;
        ed[v[great[j+1]]-j].push_back({i,great[j+1]});
      }
    }
  }
  long long sum=0;
  for(int i = 0;i<N/2;i++) {
    for(auto j:ed[i]) {
      sum+=(int)d.unite(j.second,j.first)*i;
    }
  }
  cout << sum << "\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 157384 KB Output is correct
2 Correct 376 ms 189964 KB Output is correct
3 Correct 143 ms 157644 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 157336 KB Output is correct
2 Correct 3763 ms 708600 KB Output is correct
3 Correct 131 ms 158312 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 157404 KB Output is correct
2 Correct 132 ms 157268 KB Output is correct
3 Correct 123 ms 157520 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 167284 KB Output is correct
2 Correct 242 ms 197004 KB Output is correct
3 Correct 165 ms 179724 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 159232 KB Output is correct
2 Correct 221 ms 181504 KB Output is correct
3 Correct 150 ms 167432 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 180180 KB Output is correct
2 Correct 300 ms 215088 KB Output is correct
3 Correct 164 ms 176044 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 160680 KB Output is correct
2 Correct 298 ms 218636 KB Output is correct
3 Correct 165 ms 178832 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 170952 KB Output is correct
2 Correct 1790 ms 516376 KB Output is correct
3 Correct 274 ms 173852 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 175340 KB Output is correct
2 Correct 3382 ms 679584 KB Output is correct
3 Correct 414 ms 228324 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 159476 KB Output is correct
2 Correct 3545 ms 539612 KB Output is correct
3 Correct 168 ms 178340 KB Output is correct