Submission #715392

# Submission time Handle Problem Language Result Execution time Memory
715392 2023-03-26T15:24:42 Z fuad27 Sirni (COCI17_sirni) C++17
112 / 140
3634 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+1);
  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 151 ms 274380 KB Output is correct
2 Correct 382 ms 306976 KB Output is correct
3 Correct 156 ms 274772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 223 ms 274284 KB Output is correct
2 Runtime error 2032 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 163 ms 274440 KB Output is correct
2 Correct 165 ms 274364 KB Output is correct
3 Correct 173 ms 274624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 341 ms 284968 KB Output is correct
2 Correct 642 ms 313912 KB Output is correct
3 Correct 387 ms 296092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 181 ms 276364 KB Output is correct
2 Correct 556 ms 297952 KB Output is correct
3 Correct 406 ms 285068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 517 ms 297048 KB Output is correct
2 Correct 814 ms 332116 KB Output is correct
3 Correct 376 ms 292940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 323 ms 278100 KB Output is correct
2 Correct 844 ms 335164 KB Output is correct
3 Correct 384 ms 294464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 347 ms 288496 KB Output is correct
2 Correct 1757 ms 633956 KB Output is correct
3 Correct 356 ms 292488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 318 ms 292648 KB Output is correct
2 Runtime error 2798 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 213 ms 276660 KB Output is correct
2 Correct 3634 ms 656920 KB Output is correct
3 Correct 388 ms 295488 KB Output is correct