제출 #1020057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020057		adrielcp	Sirni (COCI17_sirni)	C++17	84 / 140	814 ms	786432 KiB

sirni

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

struct DSU {
  vector<int> p, sz, mn, mx; 
  DSU(int n) {
    p = vector<int>(n);
    sz = vector<int>(n, 1);
    // mn = vector<int>(n);
    for(int i = 0; i < n; i++) p[i] = i, sz[i] = 1;
  }

  int find(int a) {
    if (a == p[a]) return p[a];
    return p[a] = find(p[a]);
  }

  int join(int a, int b) {
    int r1 = find(a);
    int r2 = find(b);
    if (r1 == r2) return 0;
    p[r1] = r2;
    sz[r2] += sz[r1];
    return 1;
  }
};

const int N = 1e7+69;

void solve() {
  int _n;cin>>_n;
  vector<int> a(_n);
  // DSU dsu(n);
  for (int i = 0; i < _n; i++) cin >> a[i];
  sort(all(a));

  vector<vector<pair<int,int>>> bruh(N,vector<pair<int,int>>());

  vector<int> nxt(N, -1);

  int n = unique(all(a)) - a.begin();

  for (int i = 0; i < n; i++) {
    nxt[a[i]] = i;
  }

  int mx = *max_element(all(a));
  for (int i = mx-1; i >= 0; i--) {
    if (nxt[i] == -1) nxt[i] = nxt[i+1];
  }
  
  for (int i = 0; i+1 < n; i++) {
    bruh[a[i+1]%a[i]].push_back({i+1, i});
    for (int j = a[i]; j <= mx; j+=a[i]) {
      bruh[a[nxt[j]]%a[i]].push_back({nxt[j], i});
    }
  }

  DSU dsu(n);

  int ans = 0;
  for (int i = 0; i < N; i++) {
    for (auto [u, v] : bruh[i]) {
      if (dsu.join(u, v)) ans += i;
    }
  }

  // // for (auto [x, y, z] : bruh) cout << x << " " << y << " " << z << endl;
  // int ans = 0;
  cout << ans << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

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