Submission #1085147

#	Time	Username	Problem	Language	Result	Execution time	Memory
1085147		fryingduc	Sirni (COCI17_sirni)	C++17	140 / 140	1138 ms	573660 KiB

sirni

#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;
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;
}
vector<pair<int, int>> e[N];
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;
  }
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  for(int i = 0; i < (int)a.size(); ++i) {
    nxt[a[i]] = i + 1;
  }
  for(int i = a.back() - 1; i > 0; --i) {
    if(!nxt[i]) 
      nxt[i] = nxt[i + 1];
  }
  for(int i = 1; i < (int)a.size(); ++i) {
      e[a[i] % a[i - 1]].push_back({i, 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) continue;
      e[a[val - 1] % a[i]].push_back({i + 1, val});
      j = a[val - 1] / a[i] * a[i];
    }
  }
  long long ans = 0;
  for(int i = 0; i <= a.back(); ++i) {
    for(auto j:e[i]) {
      if(!is_joined(j.first, j.second)) {
        ans += i;
      }
    }
  }
  cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
 
  solve();
 
  return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14