oj.uz

답안 #879942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879942 2023-11-28T11:40:45 Z TAhmed33 Akcija (COCI21_akcija) C++
10 / 110
 22 ms 860 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
const int MAXN = 2e3 + 25;
typedef long long ll;
int n, k; pair <ll, ll> a[MAXN];
vector <ll> dp[2][MAXN];
vector <ll> merge (vector <ll> &a, vector <ll> &b, ll c) {
    vector <ll> ret;
    int p1 = 0, p2 = 0;
    while ((int)ret.size() < k && p1 < (int)a.size() && p2 < (int)b.size()) {
        if (a[p1] < b[p2] + c) {
            ret.push_back(a[p1++]);
        } else {
            ret.push_back(b[p2++] + c);
        }
    }
    while ((int)ret.size() < k && p1 < (int)a.size()) ret.push_back(a[p1++]);
    while ((int)ret.size() < k && p2 < (int)b.size()) ret.push_back(b[p2++] + c);
    return ret;
}
int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1, [] (pair <ll, ll> &x, pair <ll, ll> &y) { return x.second < y.second; });
    dp[1][0].push_back(0);
    dp[1][1].push_back(a[1].first);
    for (int i = 1, c = 1; i <= n - 1; i++, c ^= 1) {
        for (int j = 0; j <= n; j++) dp[c ^ 1][j] = dp[c][j];
        for (int j = a[i + 1].second - 1; j >= 0; j--) {
            dp[c ^ 1][j + 1] = merge(dp[c ^ 1][j + 1], dp[c][j], a[i + 1].first);
        }
        int sum = 0; int bad = -1;
        for (int j = a[i + 1].second - 1; j >= 0; j--) {
            sum += dp[c ^ 1][j + 1].size();
            if (sum >= k) {
                bad = j - 1; break;
            }
        }
        for (int j = bad; j >= 0; j--) {
            dp[c ^ 1][j].clear();
        }
    }
    for (int i = n; i >= 0; i--) {
        for (auto j : dp[n & 1][i]) {
            cout << i << " " << j << '\n';
            k--;
            if (k == 0) break;
        }
        if (k == 0) break;
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 600 KB Output is correct
2 Correct 22 ms 604 KB Output is correct
3 Correct 18 ms 604 KB Output is correct
4 Correct 18 ms 608 KB Output is correct
5 Correct 21 ms 604 KB Output is correct
6 Correct 6 ms 600 KB Output is correct
7 Correct 9 ms 604 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 9 ms 600 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 600 KB Output is correct
2 Correct 22 ms 604 KB Output is correct
3 Correct 18 ms 604 KB Output is correct
4 Correct 18 ms 608 KB Output is correct
5 Correct 21 ms 604 KB Output is correct
6 Correct 6 ms 600 KB Output is correct
7 Correct 9 ms 604 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 9 ms 600 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 21 ms 604 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Incorrect 1 ms 600 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 600 KB Output is correct
2 Correct 22 ms 604 KB Output is correct
3 Correct 18 ms 604 KB Output is correct
4 Correct 18 ms 608 KB Output is correct
5 Correct 21 ms 604 KB Output is correct
6 Correct 6 ms 600 KB Output is correct
7 Correct 9 ms 604 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 9 ms 600 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 21 ms 604 KB Output isn't correct
15 Halted 0 ms 0 KB -