oj.uz

Submission #1085143

# Submission time Handle Problem Language Result Execution time Memory
1085143 2024-09-07T15:31:26 Z fryingduc Sirni (COCI17_sirni) C++17
140 / 140
 4431 ms 672424 KB 
#include "bits/stdc++.h"
using namespace std;
 
#ifdef duc_debug
#include "bits/debug.h"
#else 
#define debug(...)     
#endif
 
const int maxn = 2e5 + 5;
const int N = 1e7 + 15;
int n;
vector<int> value[N];
 
int lab[maxn];
int nxt[N];
 
int find(int u) {
  return lab[u] < 0 ? u : lab[u] = find(lab[u]);
}
bool is_joined(int u, int v) {
  u = find(u), v = find(v);
  if(u == v) return 1;
  if(lab[u] > lab[v]) swap(u, v);
  lab[u] += lab[v];
  lab[v] = u;
  return 0;
}
struct edge {
  int u, v, w;
  bool operator<(const edge &o) {
    return (w != o.w ? w < o.w : u < o.u);
  }
};
vector<edge> e;
void solve() {
  cin >> n;
  vector<int> a;
  for(int i = 1; i <= n; ++i) {
    int x; cin >> x;
    a.push_back(x);
    lab[i] = -1;
    value[x].push_back(i);
    nxt[x] = x;
  }
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  for(int i = a.back() - 1; i >= 0; --i) {
    if(!nxt[i]) 
      nxt[i] = nxt[i + 1];
    else {
      for(int j = 1; j < (int)value[i].size(); ++j) {
        is_joined(value[i][0], value[i][j]);
      }
    }
  }
  for(int i = 1; i < (int)a.size(); ++i) {
    if(value[a[i]].size() and value[a[i - 1]].size()) 
      e.push_back({value[a[i]][0], value[a[i - 1]][0], a[i] % a[i - 1]});
  }
  for(int i = 0; i < (int)a.size(); ++i) {
    for(int j = a[i] * 2; j <= a.back(); j += a[i]) {
      int val = nxt[j];
      if(!val || val - j >= a[i]) continue;
      int pos = value[val][0];
      if(pos != value[a[i]][0])
        e.push_back({value[a[i]][0], pos, (val % a[i])});
    }
  }
  sort(e.begin(), e.end());
  long long ans = 0;
  for(auto i:e) {
    if(!is_joined(i.u, i.v)) {
      ans += i.w;
    }
  }
  cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
 
  solve();
 
  return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 274508 KB Output is correct
2 Correct 164 ms 277448 KB Output is correct
3 Correct 121 ms 274468 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 235396 KB Output is correct
2 Correct 259 ms 275280 KB Output is correct
3 Correct 122 ms 274512 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 274476 KB Output is correct
2 Correct 111 ms 274376 KB Output is correct
3 Correct 116 ms 274480 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 255544 KB Output is correct
2 Correct 516 ms 292124 KB Output is correct
3 Correct 266 ms 267316 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 242884 KB Output is correct
2 Correct 362 ms 290336 KB Output is correct
3 Correct 220 ms 252988 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 292592 KB Output is correct
2 Correct 665 ms 341712 KB Output is correct
3 Correct 263 ms 267736 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 243796 KB Output is correct
2 Correct 668 ms 340948 KB Output is correct
3 Correct 263 ms 267576 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 303228 KB Output is correct
2 Correct 3035 ms 672424 KB Output is correct
3 Correct 342 ms 303144 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 303192 KB Output is correct
2 Correct 4348 ms 672028 KB Output is correct
3 Correct 393 ms 303156 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 278316 KB Output is correct
2 Correct 4431 ms 671688 KB Output is correct
3 Correct 277 ms 267560 KB Output is correct