oj.uz

Submission #996115

# Submission time Handle Problem Language Result Execution time Memory
996115 2024-06-10T08:07:58 Z faqinyeager Stove (JOI18_stove) C++17
100 / 100
 118 ms 13312 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n, k;
vector<ll> t;

int main(){
    cin >> n >> k;
    
    t.resize(n);
    
    for(int i = 0; i < n; i++) cin >> t[i];
    
    if(n <= k){
        cout << n;
        return 0;
    }
    
    vector<pair<ll, pair<ll, ll>>> pos(n - 1);
    for(int i = 0; i < n - 1; i++){
        int p = t[i + 1] - t[i];
        pos[i].first = p;
        pos[i].second = {i, i + 1};
    }
 
    sort(pos.begin(), pos.end()); 
    //for(int i = 0; i < n - 1; i++) cout << pos[i].second.first << ' ' << pos[i].second.second << " , cost - " << pos[i].first << '\n';  cout << '\n';
    
    vector<pair<pair<ll, ll>, ll>> tmp;
    
    for(int i = 0; i < n - k; i++) tmp.push_back({{pos[i].second.first + 1, pos[i].second.second + 1}, pos[i].first});
            
    int m = tmp.size();
    
    sort(tmp.begin(), tmp.end());
    //for(int i = 0; i < m; i++) cout << tmp[i].first.first << ' ' << tmp[i].first.second << '\n'; cout << '\n';
    
    map<ll, ll> parent;
    
    for(int i = 0; i < m; i++){
        if(parent[tmp[i].first.first] == 0) parent[tmp[i].first.second] = tmp[i].first.first;
        else{
            parent[tmp[i].first.second] = parent[tmp[i].first.first];
            parent[tmp[i].first.first] = 0;
        }
    }
    
    ll ans = 0;
    ll last = 0;
    
    for(auto x: parent){
        if(x.first != 0 && x.second != 0){
            ans += t[x.first - 1] - t[x.second - 1] + 1;
            last++;
        }
    }
    
    ans += (k - last);
    
    cout << ans;
    
    //for(auto x: pos) cout << x.first << ' ' << x.second.first << ' ' << x.second.second << '\n';
    
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 88 ms 12916 KB Output is correct
17 Correct 91 ms 12992 KB Output is correct
18 Correct 118 ms 13088 KB Output is correct
19 Correct 87 ms 13312 KB Output is correct
20 Correct 58 ms 10280 KB Output is correct
21 Correct 37 ms 5796 KB Output is correct
22 Correct 36 ms 4440 KB Output is correct
23 Correct 55 ms 4440 KB Output is correct
24 Correct 44 ms 4516 KB Output is correct