230022026-01-16 10:32:26gyarturMunkákcpp17Wrong answer 0/8079ms3320 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>

using namespace std;

struct Munka{
    int nap;
    int bevetel;
    int index;
};

int n, m;
int utolso;
vector<Munka> munkak;
vector<long long> maxBevetel;
vector<int> munkaIndex;
vector<int> elozoNap;

void Beolvas(){
    cin>>n>>m;
    munkak.resize(m+1);
    maxBevetel.resize(n+1, 0);
    munkaIndex.resize(n+1, 0);
    elozoNap.resize(n+1, 0);
    for(int i = 1; i <= m; i++){
        cin>>munkak[i].nap>>munkak[i].bevetel;
        munkak[i].index = i;
    }
}

bool Comapre(Munka a, Munka b){
    return a.nap < b.nap;
}

int LegnagyobbAznap(int startIndex, int nap){
    if(munkak[startIndex].nap != nap)return 0;
    int i = startIndex;
    int maxIndex = startIndex;
    while(munkak[i].nap == nap){
        if(munkak[maxIndex].bevetel < munkak[i].bevetel)maxIndex = i;
        i++;
    }
    return maxIndex;
}

int Elso(){
    if(munkak[1].nap != 1)return 1;
    int indMax = LegnagyobbAznap(1,1);
    maxBevetel[1] = munkak[indMax].bevetel;
    munkaIndex[1] = munkak[indMax].index;
    utolso = 1;
    return indMax;
}

void Feladat(){
    sort(munkak.begin()+1, munkak.end(), Comapre);
    int elozoIndex = Elso();
    for(int i = 2; i <= n && elozoIndex < m; i++){
        int indexMax = LegnagyobbAznap(elozoIndex+1, i);
        if(indexMax){
            munkaIndex[i] = munkak[indexMax].index;
            maxBevetel[i] = munkak[indexMax].bevetel;
            for(int j = 1; j < i-1; j++){
                if(maxBevetel[j] + munkak[indexMax].bevetel > maxBevetel[i]){
                    maxBevetel[i] = maxBevetel[j] + munkak[indexMax].bevetel;
                    elozoNap[i] = j;
                }
            }
            elozoIndex = indexMax;
            if(maxBevetel[i] > maxBevetel[utolso])utolso = i;
        }
    }
}

void Kiir(){
    stack<int> napIndex;
    napIndex.push(utolso);
    cout<<maxBevetel[utolso]<<' ';
    while(elozoNap[napIndex.top()]){
        napIndex.push(elozoNap[napIndex.top()]);
    }
    cout<<napIndex.size()<<'\n';
    while(!napIndex.empty()){
        cout<<munkaIndex[napIndex.top()]<<' ';
        napIndex.pop();
    }
}

int main(){
    Beolvas();
    Feladat();
    Kiir();
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms332 KiB
2Wrong answer71ms1588 KiB
subtask20/10
3Wrong answer2ms512 KiB
4Wrong answer2ms500 KiB
5Wrong answer2ms316 KiB
6Wrong answer1ms568 KiB
7Wrong answer1ms396 KiB
subtask30/10
8Wrong answer1ms316 KiB
9Wrong answer1ms316 KiB
10Wrong answer1ms508 KiB
11Wrong answer1ms316 KiB
12Wrong answer1ms388 KiB
subtask40/10
13Wrong answer2ms512 KiB
14Wrong answer2ms500 KiB
15Wrong answer2ms316 KiB
16Wrong answer1ms568 KiB
17Wrong answer1ms396 KiB
18Wrong answer1ms316 KiB
19Wrong answer1ms316 KiB
20Wrong answer1ms316 KiB
21Wrong answer1ms316 KiB
22Wrong answer1ms316 KiB
subtask50/10
23Wrong answer1ms316 KiB
24Wrong answer1ms316 KiB
25Wrong answer1ms508 KiB
26Wrong answer1ms316 KiB
27Wrong answer1ms388 KiB
28Wrong answer2ms316 KiB
29Wrong answer2ms500 KiB
30Wrong answer2ms508 KiB
31Wrong answer2ms316 KiB
32Wrong answer1ms756 KiB
subtask60/10
33Wrong answer2ms512 KiB
34Wrong answer2ms500 KiB
35Wrong answer2ms316 KiB
36Wrong answer1ms568 KiB
37Wrong answer1ms396 KiB
38Wrong answer1ms316 KiB
39Wrong answer1ms316 KiB
40Wrong answer1ms508 KiB
41Wrong answer1ms316 KiB
42Wrong answer1ms388 KiB
43Wrong answer1ms316 KiB
44Wrong answer1ms316 KiB
45Wrong answer1ms316 KiB
46Wrong answer1ms316 KiB
47Wrong answer1ms316 KiB
48Wrong answer2ms316 KiB
49Wrong answer2ms500 KiB
50Wrong answer2ms508 KiB
51Wrong answer2ms316 KiB
52Wrong answer1ms756 KiB
53Wrong answer2ms316 KiB
54Wrong answer2ms316 KiB
55Wrong answer2ms580 KiB
56Wrong answer2ms316 KiB
57Wrong answer2ms564 KiB
subtask70/10
58Wrong answer2ms512 KiB
59Wrong answer2ms500 KiB
60Wrong answer2ms316 KiB
61Wrong answer1ms568 KiB
62Wrong answer1ms396 KiB
63Wrong answer1ms316 KiB
64Wrong answer1ms316 KiB
65Wrong answer1ms508 KiB
66Wrong answer1ms316 KiB
67Wrong answer1ms388 KiB
68Wrong answer1ms316 KiB
69Wrong answer1ms316 KiB
70Wrong answer1ms316 KiB
71Wrong answer1ms316 KiB
72Wrong answer1ms316 KiB
73Wrong answer2ms316 KiB
74Wrong answer2ms500 KiB
75Wrong answer2ms508 KiB
76Wrong answer2ms316 KiB
77Wrong answer1ms756 KiB
78Wrong answer2ms316 KiB
79Wrong answer2ms316 KiB
80Wrong answer2ms580 KiB
81Wrong answer2ms316 KiB
82Wrong answer2ms564 KiB
83Wrong answer39ms1784 KiB
84Wrong answer39ms1784 KiB
85Wrong answer39ms1788 KiB
86Wrong answer39ms1788 KiB
87Wrong answer39ms1804 KiB
subtask80/20
88Wrong answer2ms512 KiB
89Wrong answer2ms500 KiB
90Wrong answer2ms316 KiB
91Wrong answer1ms568 KiB
92Wrong answer1ms396 KiB
93Wrong answer1ms316 KiB
94Wrong answer1ms316 KiB
95Wrong answer1ms508 KiB
96Wrong answer1ms316 KiB
97Wrong answer1ms388 KiB
98Wrong answer1ms316 KiB
99Wrong answer1ms316 KiB
100Wrong answer1ms316 KiB
101Wrong answer1ms316 KiB
102Wrong answer1ms316 KiB
103Wrong answer2ms316 KiB
104Wrong answer2ms500 KiB
105Wrong answer2ms508 KiB
106Wrong answer2ms316 KiB
107Wrong answer1ms756 KiB
108Wrong answer2ms316 KiB
109Wrong answer2ms316 KiB
110Wrong answer2ms580 KiB
111Wrong answer2ms316 KiB
112Wrong answer2ms564 KiB
113Wrong answer39ms1784 KiB
114Wrong answer39ms1784 KiB
115Wrong answer39ms1788 KiB
116Wrong answer39ms1788 KiB
117Wrong answer39ms1804 KiB
118Wrong answer78ms3124 KiB
119Wrong answer79ms3156 KiB
120Wrong answer79ms3316 KiB
121Wrong answer79ms3124 KiB
122Wrong answer79ms3124 KiB
123Wrong answer76ms3124 KiB
124Wrong answer79ms3152 KiB
125Wrong answer79ms3320 KiB
126Wrong answer79ms3124 KiB
127Wrong answer79ms3316 KiB