Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- #include <fstream>
- #include <queue>
- #include <map>
- #include <set>
- #include <unordered_set>
- #include <tuple>
- #include <unordered_map>
- #include <deque>
- #include <cmath>
- using namespace std;
- const long long INF = 1e18;
- int main() {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- ifstream cin("input.txt");
- ofstream cout("output.txt");
- int n, k;
- cin >> n >> k;
- if (k == 0) {
- for (int i = 1; i <= n; i++) {
- cout << 0 << " " << 0 << '\n';
- }
- return 0;
- }
- vector<vector<int>> a(n + 1, vector<int> (2));
- vector<vector<vector<long long>>> dp(n + 1, vector<vector<long long>> (k + 1, vector<long long> (4, INF)));
- vector<vector<vector<long long>>> p(n + 1, vector<vector<long long>> (k + 1, vector<long long> (4, INF)));
- cin >> a[1][0] >> a[1][1];
- dp[1][0][0] = a[1][0] + a[1][1];
- dp[1][1][3] = 0;
- for (int i = 2; i <= n; i++){
- cin >> a[i][0] >> a[i][1];
- for (int j = 0; j <= k; j++){
- dp[i][j][0] = min(min(dp[i - 1][j][0], dp[i - 1][j][1]),
- min(dp[i - 1][j][2], dp[i - 1][j][3]));
- dp[i][j][0] += a[i][0] + a[i][1];
- if (j >= 1) dp[i][j][1] = min(dp[i - 1][j - 1][0], dp[i - 1][j - 1][2]) + a[i][1] - a[i - 1][0];
- if (j >= 1) dp[i][j][2] = min(dp[i - 1][j - 1][0], dp[i - 1][j - 1][1]) + a[i][0] - a[i - 1][1];
- if (j >= 1) dp[i][j][3] = min(min(dp[i - 1][j - 1][0], dp[i - 1][j - 1][1]),
- min(dp[i - 1][j - 1][2], dp[i - 1][j - 1][3]));
- }
- }
- int min_ans = 1e9, ind = 0;
- for (int i = 0; i < 4; i++) {
- if (min_ans > dp[n][k][i]) {
- min_ans = dp[n][k][i];
- ind = i;
- }
- }
- int nn = n, kk = k;
- vector<vector<int>> ans(n + 1, vector<int> (2, 0));
- while (nn > 0){
- if (ind == 0){
- nn -= 1;
- min_ans = min(min(dp[nn][kk][0], dp[nn][kk][1]), min(dp[nn][kk][2], dp[nn][kk][3]));
- if (min_ans == dp[nn][kk][0]) ind = 0;
- if (min_ans == dp[nn][kk][1]) ind = 1;
- if (min_ans == dp[nn][kk][2]) ind = 2;
- if (min_ans == dp[nn][kk][3]) ind = 3;
- } else if (ind == 1){
- ans[nn][0] = kk;
- ans[nn - 1][0] = kk;
- nn -= 1;
- kk -= 1;
- min_ans = min(dp[nn][kk][0], dp[nn][kk][2]);
- if (min_ans == dp[nn][kk][0]) ind = 0;
- if (min_ans == dp[nn][kk][2]) ind = 2;
- } else if (ind == 2){
- ans[nn][1] = kk;
- ans[nn - 1][1] = kk;
- nn -= 1;
- kk -= 1;
- min_ans = min(dp[nn][kk][0], dp[nn][kk][1]);
- if (min_ans == dp[nn][kk][0]) ind = 0;
- if (min_ans == dp[nn][kk][1]) ind = 1;
- } else {
- ans[nn][0] = kk;
- ans[nn][1] = kk;
- nn -= 1;
- kk -= 1;
- min_ans = min(min(dp[nn][kk][0], dp[nn][kk][1]),
- min(dp[nn][kk][2], dp[nn][kk][3]));
- if (min_ans == dp[nn][kk][0]) ind = 0;
- if (min_ans == dp[nn][kk][1]) ind = 1;
- if (min_ans == dp[nn][kk][2]) ind = 2;
- if (min_ans == dp[nn][kk][3]) ind = 3;
- }
- }
- for (int i = 1; i <= n; i++){
- cout << ans[i][0] << " " << ans[i][1] << '\n';
- }
- cout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement