133482025-01-07 16:40:35horkaBenzinkút üzemeltetés (55)cpp17Wrong answer 12/5539ms31824 KiB
#include <bits/stdc++.h>
using namespace std;
const int c=1000050;
int dp[c],last[c],ind[c];
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n; cin>>n;
    int k; cin>>k;
    vector<array<int, 2>> v(n+1);
    for(int i=1; i<=n; i++)
        cin>>v[i][0]>>v[i][1];
    vector<vector<array<int, 3>>> vissza(c);
    for(int i=1; i<=n; i++)
    {
        vissza[v[i][0]].push_back({v[i][0]-k,v[i][1],i});
    }
    for(int i=1; i<c; i++)
    {
        dp[i]=dp[i-1];
        last[i]=i-1;
        for(auto &[honn,ar,j]:vissza[i])
        {
            int l=0;
            if(honn>=0) l=dp[honn];
            if(l+ar>0)
            {
                last[i]=max(0,honn);
                ind[i]=j;
                dp[i]=l+ar;
            }
        }
    }
    cout<<dp[c-1]<<"\n";
    vector<int> ans;
    int x=c-1;
    while(x>0)
    {
        if(ind[x]) ans.push_back(ind[x]);
        x=last[x];
    }
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<" ";
    for(int i:ans)
        cout<<i<<" ";
    cout<<"\n";
}
SubtaskSumTestVerdictTimeMemory
base12/55
1Wrong answer0/030ms31540 KiB
2Wrong answer0/039ms31804 KiB
3Accepted3/330ms31540 KiB
4Accepted3/337ms31540 KiB
5Wrong answer0/339ms31544 KiB
6Accepted3/337ms31532 KiB
7Wrong answer0/330ms31532 KiB
8Accepted3/330ms31544 KiB
9Wrong answer0/337ms31540 KiB
10Wrong answer0/330ms31760 KiB
11Wrong answer0/330ms31552 KiB
12Wrong answer0/339ms31800 KiB
13Wrong answer0/437ms31592 KiB
14Wrong answer0/430ms31792 KiB
15Wrong answer0/539ms31796 KiB
16Wrong answer0/630ms31796 KiB
17Wrong answer0/637ms31824 KiB