oj.uz

Submission #715400

# Submission time Handle Problem Language Result Execution time Memory
715400 2023-03-26T15:40:24 Z fuad27 Sirni (COCI17_sirni) C++17
112 / 140
 3161 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 {
  int e[(int)1e5+10];
  DSU(int N) {memset(e,-1, sizeof e);}
  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;
DSU d(1e5+10);
int main () {
  cin.tie(0)->sync_with_stdio(0);
  for(int i = 0;i<N;i++)great[i]=1e9;
  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 = 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]});
      }
    }
  }
  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";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 274744 KB Output is correct
2 Correct 357 ms 307328 KB Output is correct
3 Correct 148 ms 275164 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 274704 KB Output is correct
2 Runtime error 1940 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 148 ms 274800 KB Output is correct
2 Correct 142 ms 274732 KB Output is correct
3 Correct 148 ms 274872 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 284628 KB Output is correct
2 Correct 582 ms 314216 KB Output is correct
3 Correct 333 ms 297104 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 276744 KB Output is correct
2 Correct 537 ms 298944 KB Output is correct
3 Correct 354 ms 284972 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 466 ms 297640 KB Output is correct
2 Correct 728 ms 332628 KB Output is correct
3 Correct 326 ms 293388 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 278184 KB Output is correct
2 Correct 776 ms 335980 KB Output is correct
3 Correct 331 ms 296284 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 288460 KB Output is correct
2 Correct 1672 ms 633908 KB Output is correct
3 Correct 282 ms 291368 KB Output is correct

Subtask #9
0 / 14.0

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

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 276940 KB Output is correct
2 Correct 3161 ms 657088 KB Output is correct
3 Correct 347 ms 295688 KB Output is correct