Submission #715396

# Submission time Handle Problem Language Result Execution time Memory
715396 2023-03-26T15:27:39 Z fuad27 Sirni (COCI17_sirni) C++17
112 / 140
3395 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,int>> ed[N];
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[v[great[j]]-j].push_back({i,great[j]});
        }
      }
      else if(great[j+1]<n) {
        ed[v[great[j+1]]-j].push_back({i,great[j+1]});
      }
    }
  }
  DSU d(N+10);
  long long sum=0;
  for(int i = 0;i<N-3;i++) {
    for(auto j:ed[i]) {
      sum+=(int)d.unite(j.second,j.first)*i;
    }
  }
  cout << sum << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 180 ms 313556 KB Output is correct
2 Correct 390 ms 346112 KB Output is correct
3 Correct 173 ms 313924 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 226 ms 313536 KB Output is correct
2 Runtime error 2053 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 170 ms 313548 KB Output is correct
2 Correct 173 ms 313452 KB Output is correct
3 Correct 200 ms 313600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 348 ms 324060 KB Output is correct
2 Correct 710 ms 352748 KB Output is correct
3 Correct 460 ms 334596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 195 ms 315340 KB Output is correct
2 Correct 585 ms 337076 KB Output is correct
3 Correct 513 ms 323900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 511 ms 335116 KB Output is correct
2 Correct 827 ms 367532 KB Output is correct
3 Correct 402 ms 331568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 295 ms 317176 KB Output is correct
2 Correct 853 ms 372844 KB Output is correct
3 Correct 384 ms 333312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 284 ms 327288 KB Output is correct
2 Correct 1711 ms 672444 KB Output is correct
3 Correct 371 ms 330188 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 349 ms 331412 KB Output is correct
2 Runtime error 2537 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 199 ms 315728 KB Output is correct
2 Correct 3395 ms 695224 KB Output is correct
3 Correct 395 ms 333872 KB Output is correct