oj.uz

답안 #136434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136434 2019-07-25T10:01:32 Z darkkcyan Sirni (COCI17_sirni) C++14
112 / 140
 5000 ms 523356 KB 
#include <bits/stdc++.h>
using namespace std;
using namespace std::placeholders;

// #define rand __rand
// mt19937 rand(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
#define llong long long 
#define xx first
#define yy second
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define all(x) x.begin(), x.end()

template<class T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

#define maxn 101010
#define maxval ((llong)1e7+10)
int n;
int a[maxn];

int dsu[maxn];
int n_set;
int findp(int u) { return u == dsu[u] ? u : dsu[u] = findp(dsu[u]); }
void join(int u, int v) {
    u = findp(u);
    v = findp(v);
    if (u == v) return ;
    if (rand() & 1) swap(u, v);
    dsu[u] = v;
    --n_set;
}
int lower_b[maxval] = {0};
vector<pair<int, int>> group[maxval];
int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    rep(i, n) cin >> a[i];
    sort(a, a + n);
    
    n = (int)(unique(a, a + n) - a);

    int f = 0;
    rep(i, n) {
        for (; f <= a[i]; ++f) lower_b[f] = i;
    }
    for (; f < maxval; ++f) lower_b[f] = n;

    llong cnt = 0;
    rep(i, n) {
        // clog << i << ' ' << a[i] << endl;
        for (int k = 1; k * a[i] <= a[n - 1]; ++k) {
            int t = lower_b[k * a[i]];
            if (t != n and a[t] == a[i]) ++t;
            if (t == n) break;
            group[a[t] % a[i]].emplace_back(i, t);
            k = a[t] / a[i];
            ++cnt;
        }
    }

    n_set = n;
    rep1(i, n) dsu[i] = i;

    llong ans = 0;
    for (int cost = 0; cost < maxval and n_set != 1; ++cost) {
        for (auto i: group[cost]) {
            if (n_set == 1) break;
            int src = i.xx, cur = i.yy;
            if (findp(src) != findp(cur)) {
                ans += cost;
                join(src, cur);
            }

            int div = a[cur] / a[src];
            ++cur;
            if (cur == n or a[cur] / a[src] != div) continue;
            group[a[cur] % a[src]].emplace_back(src, cur);
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 254 ms 274680 KB Output is correct
2 Correct 277 ms 276896 KB Output is correct
3 Correct 255 ms 274828 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 252 ms 274408 KB Output is correct
2 Correct 297 ms 275152 KB Output is correct
3 Correct 279 ms 274612 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 272 ms 274616 KB Output is correct
2 Correct 424 ms 274648 KB Output is correct
3 Correct 279 ms 274680 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 292260 KB Output is correct
2 Correct 955 ms 325620 KB Output is correct
3 Correct 435 ms 291496 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 274 ms 276340 KB Output is correct
2 Correct 584 ms 298800 KB Output is correct
3 Correct 442 ms 294952 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 674 ms 311912 KB Output is correct
2 Correct 825 ms 331928 KB Output is correct
3 Correct 400 ms 291200 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 280840 KB Output is correct
2 Correct 1018 ms 332368 KB Output is correct
3 Correct 428 ms 290520 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 567 ms 293320 KB Output is correct
2 Correct 4018 ms 488524 KB Output is correct
3 Correct 615 ms 296196 KB Output is correct

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 521 ms 288848 KB Output is correct
2 Execution timed out 5043 ms 522400 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 278816 KB Output is correct
2 Execution timed out 5089 ms 523356 KB Time limit exceeded
3 Halted 0 ms 0 KB -