oj.uz

Submission #1049729

# Submission time Handle Problem Language Result Execution time Memory
1049729 2024-08-09T04:30:36 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 33 ms 29968 KB 
#include <bits/stdc++.h>
// #define DEBUG 1
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx,mmx,tune=native")
// #include <ext/pb_ds/detail/standard_policies.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
/* find_by_order() order_of_key() */
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif
#define elif else if
#define pb push_back
#define fast cin.tie(nullptr); ios_base::sync_with_stdio(false);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define str to_string
#define sz(x) int(x.size())
#define F first
#define S second
#define FOR(i, a, b) for (int i=a; i < (b); i++)
#define F0R(i, a) for (int i=0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define watch(x) cout << #x << " <----  " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename A, typename B>
inline bool umin(A& a, B b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
 
template<typename A, typename B>
inline bool umax(A& a, B b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
template<typename T>
T binpow(T b, T e, T m) {
    T r = 1;
    while(e > 0) {
        if(e & 1) r = r * b % m;
        b = b * b % m;
        e >>= 1;
    }
    return r;
}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
inline ll rand(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}
const int N = 1e6 + 1;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
ll n, m, k, q;
int h1[4] = {1, 0, 0, -1};
int h2[4] = {0, -1, 1, 0};
ll a[N];
bool check(int x, int y) {
    return (x >= 0 && y >= 0 && x < n && y < m);
}
int go(char c) {
    return c - '0';
}
vector<ll> adj[N];
/* Problems solved, rank evolved. */
void tourist() {
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    //     freopen("output.txt", "w", stdout);
    //     freopen("errors.txt", "w", stderr);
    // #endif
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    multiset<ll> s;
    ll ans = n;
    for(int i = 2; i <= n; i++){
      s.insert(a[i] - a[i - 1] - 1);
    }
    k--;
    while(k--){
      s.erase(s.find(*s.rbegin()));
    }
    for(ll i : s){
      ans += i;
    }
    cout << ans <<'\n';
}

/*Give me some sunshine, give me some rain, its a beatifull day-ay-ay-ay...*/
int32_t main() {
    fast
    int tt = 1;
    // cin >> tt;
    while (tt--) {
        tourist();
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 25180 KB Output is correct
2 Correct 3 ms 25180 KB Output is correct
3 Correct 3 ms 25180 KB Output is correct
4 Correct 3 ms 25180 KB Output is correct
5 Correct 3 ms 25180 KB Output is correct
6 Correct 4 ms 25176 KB Output is correct
7 Correct 3 ms 25192 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Correct 3 ms 25180 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 25180 KB Output is correct
2 Correct 3 ms 25180 KB Output is correct
3 Correct 3 ms 25180 KB Output is correct
4 Correct 3 ms 25180 KB Output is correct
5 Correct 3 ms 25180 KB Output is correct
6 Correct 4 ms 25176 KB Output is correct
7 Correct 3 ms 25192 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Correct 3 ms 25180 KB Output is correct
10 Correct 6 ms 25216 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25400 KB Output is correct
13 Correct 4 ms 25180 KB Output is correct
14 Correct 3 ms 25180 KB Output is correct
15 Correct 4 ms 25176 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 25180 KB Output is correct
2 Correct 3 ms 25180 KB Output is correct
3 Correct 3 ms 25180 KB Output is correct
4 Correct 3 ms 25180 KB Output is correct
5 Correct 3 ms 25180 KB Output is correct
6 Correct 4 ms 25176 KB Output is correct
7 Correct 3 ms 25192 KB Output is correct
8 Correct 3 ms 25180 KB Output is correct
9 Correct 3 ms 25180 KB Output is correct
10 Correct 6 ms 25216 KB Output is correct
11 Correct 4 ms 25180 KB Output is correct
12 Correct 4 ms 25400 KB Output is correct
13 Correct 4 ms 25180 KB Output is correct
14 Correct 3 ms 25180 KB Output is correct
15 Correct 4 ms 25176 KB Output is correct
16 Correct 29 ms 29692 KB Output is correct
17 Correct 30 ms 29776 KB Output is correct
18 Correct 29 ms 29788 KB Output is correct
19 Correct 28 ms 29968 KB Output is correct
20 Correct 29 ms 29776 KB Output is correct
21 Correct 30 ms 29788 KB Output is correct
22 Correct 28 ms 29784 KB Output is correct
23 Correct 33 ms 29880 KB Output is correct
24 Correct 32 ms 29872 KB Output is correct