131832025-01-06 21:19:25ubormaciBenzinkút üzemeltetés (55)cpp17Elfogadva 55/552ms392 KiB
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

set lower bound/upper bound:
 	// . . . m1 . . . d . . . . m2
    auto m1_it = b.lower_bound(d);
    advance(m1_it, -1);
    m1 = *m1_it;
	m2 = *b.upper_bound(d);

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

constexpr auto lcm(auto x, auto... xs)
{
	return ((x = std::lcm(x, xs)), ...);
}

std::gcd(int a, int b)

*/

typedef long long ll;

struct s{
    ll poz;
    ll val;
    ll ind;
};

bool cmp(s a, s b) {
    if(a.poz == b.poz) {
        return a.val > b.val;
    }

    return a.poz < b.poz;
}

void solve() {
    ll n, k;
    cin >> n >> k;
    vector<s> v(n);
    for(ll i = 0; i < n; i++) {
        cin >> v[i].poz >> v[i].val;
        v[i].ind = i + 1;

    }

    // dp

    set<ll> out;

    n++;
    v.push_back({0,0,0});

    sort(v.begin(), v.end(), cmp);

    vector<ll> dp(n, 0);
    //dp[0] = 0;
    for(ll i = 1; i < n; i++) {
        ll bj = 0;
        for(ll j = i - 1; j >= 1; j--) {
            if(v[j].poz <= v[i].poz - k) {
                bj = j;
                break;
            }
        }

        dp[i] = max(dp[i-1], dp[bj] + v[i].val);
    }

    //cerr << "\ndp=" << dp;

    ll maxprofit = dp[n - 1];

    vector<ll> selected;
    ll i = n - 1;
    ll src = maxprofit;
    while(i > 0){
        //cerr << "\ni=" << i;
        //cerr << "\nsrc=" << src;
        //cerr << "\ndp[i]=" << dp[i];
        if(dp[i] != dp[i-1] && dp[i] == src){
            selected.push_back(v[i].ind);
            src -= v[i].val;
        }
        i--;
    }

    sort(selected.begin(), selected.end());

    cout << maxprofit << "\n" << selected.size() << " ";
    for(const auto & x : selected) {
        cout << x << " ";
    }


}

int main()
{
	std::ios_base::sync_with_stdio(false);

	solve();

	return 0;
}
RészfeladatÖsszpontTesztVerdiktIdőMemória
base55/55
1Elfogadva0/01ms316 KiB
2Elfogadva0/02ms316 KiB
3Elfogadva3/31ms316 KiB
4Elfogadva3/31ms316 KiB
5Elfogadva3/31ms364 KiB
6Elfogadva3/31ms316 KiB
7Elfogadva3/31ms316 KiB
8Elfogadva3/31ms316 KiB
9Elfogadva3/31ms316 KiB
10Elfogadva3/31ms316 KiB
11Elfogadva3/31ms392 KiB
12Elfogadva3/31ms316 KiB
13Elfogadva4/41ms316 KiB
14Elfogadva4/41ms320 KiB
15Elfogadva5/51ms316 KiB
16Elfogadva6/61ms316 KiB
17Elfogadva6/61ms316 KiB