oj.uz

Submission #1020066

# Submission time Handle Problem Language Result Execution time Memory
1020066 2024-07-11T13:26:32 Z adrielcp Sirni (COCI17_sirni) C++17
84 / 140
 709 ms 786432 KB 
#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;
  }

  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;
vector<pair<int, int>> bruh[N];
int nxt[N];

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));
  fill(nxt, nxt+N, -1);

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

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

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

  int mx = 0;
  for (int i = 0; i < n; i++) {
    nxt[a[i]] = i;
    mx = max(mx, a[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 < mx; 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.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 313684 KB Output is correct
2 Correct 200 ms 370236 KB Output is correct
3 Correct 139 ms 314200 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 313684 KB Output is correct
2 Runtime error 588 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 138 ms 313728 KB Output is correct
2 Correct 135 ms 313592 KB Output is correct
3 Correct 165 ms 313768 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 335176 KB Output is correct
2 Correct 262 ms 391368 KB Output is correct
3 Correct 211 ms 360372 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 317900 KB Output is correct
2 Correct 181 ms 359112 KB Output is correct
3 Correct 189 ms 336080 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 361012 KB Output is correct
2 Correct 267 ms 428012 KB Output is correct
3 Correct 181 ms 353696 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 321420 KB Output is correct
2 Correct 258 ms 427332 KB Output is correct
3 Correct 179 ms 356396 KB Output is correct

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

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