oj.uz

답안 #996077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996077 2024-06-10T07:45:35 Z faqinyeager Stove (JOI18_stove) C++17
0 / 100
 1 ms 348 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());
    
    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());
        
    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 = max(last, max(x.first, x.second));
        }
    }
    
    if(last < n) ans++;
    
    cout << ans;
    
    //for(auto x: pos) cout << x.first << ' ' << x.second.first << ' ' << x.second.second << '\n';
    
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -