oj.uz

Submission #589249

# Submission time Handle Problem Language Result Execution time Memory
589249 2022-07-04T10:59:15 Z MohamedFaresNebili Stove (JOI18_stove) C++14
100 / 100
 32 ms 7624 KB 
#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

                using namespace std;

                using ll = long long;
                using ld = long double;
                using ii = pair<ll, ll>;
                using vi = vector<int>;

                #define ff first
                #define ss second
                #define pb push_back
                #define all(x) (x).begin(), (x).end()
                #define lb lower_bound
                #define int ll
                #define double ld

                const int MOD = 1000 * 1000 * 1000 + 7;
                const double EPS = 1e-9;

                int N, K, A[100001], par[100001];
                int lf[100001], rf[100001];
                int res, C; bool vis[100001];
                int findSet(int v) {
                    if(par[v] == v) return v;
                    return par[v] = findSet(par[v]);
                }
                void unionSet(int u, int v) {
                    u = findSet(u), v = findSet(v);
                    if(u == v) return;
                    if(lf[u] > lf[v]) swap(u, v);
                    par[v] = u; rf[u] = rf[v]; C--;
                }

                int32_t main() {
                    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
                    cin >> N >> K; C = N;
                    for(int l = 0; l < N; l++) cin >> A[l];
                    for(int l = 0; l < N; l++)
                        par[l] = l, lf[l] = A[l], rf[l] = A[l];
                    vector<pair<int, pair<int, int>>> E;
                    for(int l = 1; l < N; l++) {
                        E.pb({A[l] - A[l - 1], {l, l - 1}});
                    }
                    sort(E.begin(), E.end());
                    reverse(E.begin(), E.end());
                    while(E.size() && C > K) {
                        pair<int, pair<int, int>> P = E.back();
                        int U = P.ss.ff, V = P.ss.ss;
                        unionSet(U, V); E.pop_back();
                    }
                    for(int l = 0; l < N; l++) {
                        int i = findSet(l);
                        if(vis[i]) continue;
                        res += (rf[i] - lf[i] + 1);
                        vis[i] = 1;
                    }
                    cout << res << "\n";
                    return 0;
                }

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 648 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 596 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 648 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 28 ms 7612 KB Output is correct
17 Correct 32 ms 7564 KB Output is correct
18 Correct 27 ms 7624 KB Output is correct
19 Correct 31 ms 7624 KB Output is correct
20 Correct 24 ms 7556 KB Output is correct
21 Correct 24 ms 7564 KB Output is correct
22 Correct 23 ms 7624 KB Output is correct
23 Correct 24 ms 7556 KB Output is correct
24 Correct 23 ms 7564 KB Output is correct