oj.uz

Submission #1106922

# Submission time Handle Problem Language Result Execution time Memory
1106922 2024-10-31T09:14:15 Z manhlinh1501 Sirni (COCI17_sirni) C++17
84 / 140
 632 ms 786432 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

template<class X, class Y>
bool minimize(X &x, const Y &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

struct edge {
    int u, v;
    i64 w;
    edge(int u = 0, int v = 0, i64 w = 0) : u(u), v(v), w(w) {}
};

const int MAXN = 1e7 + 5;

namespace dsu {
    vector<int> lab;

    void init(int N) {
        lab.assign(N + 5, -1);
    }

    int root(int u) {
        if(lab[u] < 0) return u;
        return lab[u] = root(lab[u]);
    }

    bool is_same(int u, int v) {
        return root(u) == root(v);
    }

    bool join(int u, int v) {
        if(is_same(u, v)) return false;

        u = root(u);
        v = root(v);

        if(lab[u] > lab[v]) swap(u, v);

        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }
}

int N;
int b[MAXN + 5];
vector<edge> edges;

signed main() {
#define task "code"
    if(fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N;
    vector<int> a(N + 1, 0);
    for(int i = 1; i <= N; i++) cin >> a[i];
    sort(a.begin() + 1, a.end());
    dsu::init(N);
    for(int i = 1; i <= N; i++) {
        int j = i;
        while(j < N and a[i] == a[j + 1]) {
            dsu::join(i, j);
            j++;
        }
        b[a[i]] = i;
        i = j;
    }
    for(int i = a[N]; i >= 1; i--)
        b[i] = (b[i] == 0 ? b[i + 1] : b[i]);
    for(int i = 1; i <= N; i++) {
        int j = i;
        while(j < N and a[i] == a[j + 1]) {
            dsu::join(i, j);
            j++;
        }
        dsu::join(i, j);
        if(b[a[i] + 1])
            edges.emplace_back(i, b[a[i] + 1], a[b[a[i] + 1]] % a[i]);
        for(int j = a[i]; j <= a[N]; j += a[i]) {
            if(b[j])
                edges.emplace_back(i, b[j], a[b[j]] % a[i]);
        }
        i = j;
    }
    sort(edges.begin(), edges.end(), [&](edge a, edge b) {
        return a.w < b.w;
    });
    i64 ans = 0;
    for(auto [u, v, w] : edges) {
        if(dsu::join(u, v))
            ans += w;
    }
    cout << ans;
    return (0 ^ 0);
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sirni.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 39760 KB Output is correct
2 Correct 133 ms 107184 KB Output is correct
3 Correct 14 ms 39892 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Runtime error 496 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 13 ms 39760 KB Output is correct
2 Correct 19 ms 39504 KB Output is correct
3 Correct 15 ms 39956 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 40488 KB Output is correct
2 Correct 239 ms 138788 KB Output is correct
3 Correct 114 ms 73376 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10944 KB Output is correct
2 Correct 159 ms 73160 KB Output is correct
3 Correct 62 ms 38332 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 73136 KB Output is correct
2 Correct 280 ms 139048 KB Output is correct
3 Correct 104 ms 40380 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 13264 KB Output is correct
2 Correct 322 ms 138912 KB Output is correct
3 Correct 106 ms 73140 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 75188 KB Output is correct
2 Runtime error 632 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 130 ms 75196 KB Output is correct
2 Runtime error 587 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 30 ms 46016 KB Output is correct
2 Runtime error 606 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -