229812026-01-16 10:10:29bokormate012Munkákcpp17Runtime error 0/80689ms65536 KiB
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

//ifstream f("graf.txt");

struct munka{
    int nap;
    int ar;
    int sorszam;
};

int n,m;
vector<munka> M;
vector<int> Osszeg;
vector<int> Osvektor;
stack<int> Indexek;

void beolvas(){
    cin>>n>>m;
    M.resize(n+1);
    for(int i=1;i<=m;i++){
        munka m1;
        cin>>m1.nap>>m1.ar;
        m1.sorszam=i;
        if(M[m1.nap].ar<m1.ar){
            M[m1.nap]=m1;
        }
    }
}

void kiir_M(){
    for(int i=1;i<=n;i++){
        cout<<M[i].nap<<' '<<M[i].ar<<' '<<M[i].sorszam<<'\n';
    }
}

void munkaa(){
    Osszeg.resize(n+1);
    Osvektor.resize(n+1);
    for(int i=1;i<=n;i++){
        if(i<=2){
            Osszeg[i]=M[i].ar;
            Osvektor[i]=0;
        }
        else{
            munka maxi_munka;
            maxi_munka.ar=0;
            for(int j=1;j<i-1;j++){
                if(M[j].ar>=maxi_munka.ar){
                    maxi_munka=M[j];
                }
            }
            Osvektor[i]=maxi_munka.sorszam;
            Osszeg[i]=Osszeg[maxi_munka.nap]+M[i].ar;
            //cout<<'\n'<<maxi_munka.nap<<' '<<maxi_munka.ar<<' '<<maxi_munka.sorszam;
        }
    }
    int maxi=0,kindex;
    munka maxi_munka2;
    maxi_munka2.ar=0;
    for(int i=1;i<=n;i++){
        if(Osszeg[i]>maxi){
            maxi=Osszeg[i];
            kindex=i;
        }
    }
    int drb=0;
    cout<<maxi;
    Indexek.push(kindex);
    int index=kindex;
    while(index){
        if(Osvektor[index]!=0)Indexek.push(Osvektor[index]);
        drb++;
        index=Osvektor[index];
    }
    cout<<' '<<drb;
    //cout<<'\n'<<maxi_munka2.nap<<' '<<maxi_munka2.ar<<' '<<maxi_munka2.sorszam<<'\n';
}

void stack_kiir(){
    cout<<'\n';
    while(!Indexek.empty()){
        cout<<Indexek.top()<<' ';
        Indexek.pop();
    }
}

void osszeg_kiir(){
    cout<<'\n';
    for(int i=1;i<=n;i++){
        cout<<Osszeg[i]<<' ';
    }
}

void os_kiir(){
    cout<<'\n';
    for(int i=1;i<=n;i++){
        cout<<Osvektor[i]<<' ';
    }
}

int main()
{
    beolvas();
    //kiir_M();
    munkaa();
    //osszeg_kiir();
    //os_kiir();
    stack_kiir();



    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Runtime error144ms564 KiB
subtask20/10
3Partially correct1ms316 KiB
4Runtime error108ms65536 KiB
5Partially correct1ms316 KiB
6Partially correct1ms316 KiB
7Partially correct1ms316 KiB
subtask30/10
8Wrong answer1ms316 KiB
9Wrong answer1ms512 KiB
10Runtime error107ms65536 KiB
11Wrong answer1ms316 KiB
12Wrong answer1ms400 KiB
subtask40/10
13Partially correct1ms316 KiB
14Runtime error108ms65536 KiB
15Partially correct1ms316 KiB
16Partially correct1ms316 KiB
17Partially correct1ms316 KiB
18Wrong answer1ms316 KiB
19Wrong answer1ms508 KiB
20Wrong answer1ms316 KiB
21Wrong answer1ms316 KiB
22Wrong answer1ms316 KiB
subtask50/10
23Wrong answer1ms316 KiB
24Wrong answer1ms512 KiB
25Runtime error107ms65536 KiB
26Wrong answer1ms316 KiB
27Wrong answer1ms400 KiB
28Wrong answer20ms492 KiB
29Wrong answer28ms516 KiB
30Wrong answer39ms316 KiB
31Wrong answer54ms552 KiB
32Wrong answer87ms756 KiB
subtask60/10
33Partially correct1ms316 KiB
34Runtime error108ms65536 KiB
35Partially correct1ms316 KiB
36Partially correct1ms316 KiB
37Partially correct1ms316 KiB
38Wrong answer1ms316 KiB
39Wrong answer1ms512 KiB
40Runtime error107ms65536 KiB
41Wrong answer1ms316 KiB
42Wrong answer1ms400 KiB
43Wrong answer1ms316 KiB
44Wrong answer1ms508 KiB
45Wrong answer1ms316 KiB
46Wrong answer1ms316 KiB
47Wrong answer1ms316 KiB
48Wrong answer20ms492 KiB
49Wrong answer28ms516 KiB
50Wrong answer39ms316 KiB
51Wrong answer54ms552 KiB
52Wrong answer87ms756 KiB
53Wrong answer89ms592 KiB
54Wrong answer87ms564 KiB
55Wrong answer90ms600 KiB
56Wrong answer87ms564 KiB
57Runtime error209ms65536 KiB
subtask70/10
58Partially correct1ms316 KiB
59Runtime error108ms65536 KiB
60Partially correct1ms316 KiB
61Partially correct1ms316 KiB
62Partially correct1ms316 KiB
63Wrong answer1ms316 KiB
64Wrong answer1ms512 KiB
65Runtime error107ms65536 KiB
66Wrong answer1ms316 KiB
67Wrong answer1ms400 KiB
68Wrong answer1ms316 KiB
69Wrong answer1ms508 KiB
70Wrong answer1ms316 KiB
71Wrong answer1ms316 KiB
72Wrong answer1ms316 KiB
73Wrong answer20ms492 KiB
74Wrong answer28ms516 KiB
75Wrong answer39ms316 KiB
76Wrong answer54ms552 KiB
77Wrong answer87ms756 KiB
78Wrong answer89ms592 KiB
79Wrong answer87ms564 KiB
80Wrong answer90ms600 KiB
81Wrong answer87ms564 KiB
82Runtime error209ms65536 KiB
83Time limit exceeded677ms1332 KiB
84Time limit exceeded676ms1340 KiB
85Time limit exceeded676ms1348 KiB
86Time limit exceeded677ms1516 KiB
87Time limit exceeded685ms1332 KiB
subtask80/20
88Partially correct1ms316 KiB
89Runtime error108ms65536 KiB
90Partially correct1ms316 KiB
91Partially correct1ms316 KiB
92Partially correct1ms316 KiB
93Wrong answer1ms316 KiB
94Wrong answer1ms512 KiB
95Runtime error107ms65536 KiB
96Wrong answer1ms316 KiB
97Wrong answer1ms400 KiB
98Wrong answer1ms316 KiB
99Wrong answer1ms508 KiB
100Wrong answer1ms316 KiB
101Wrong answer1ms316 KiB
102Wrong answer1ms316 KiB
103Wrong answer20ms492 KiB
104Wrong answer28ms516 KiB
105Wrong answer39ms316 KiB
106Wrong answer54ms552 KiB
107Wrong answer87ms756 KiB
108Wrong answer89ms592 KiB
109Wrong answer87ms564 KiB
110Wrong answer90ms600 KiB
111Wrong answer87ms564 KiB
112Runtime error209ms65536 KiB
113Time limit exceeded677ms1332 KiB
114Time limit exceeded676ms1340 KiB
115Time limit exceeded676ms1348 KiB
116Time limit exceeded677ms1516 KiB
117Time limit exceeded685ms1332 KiB
118Time limit exceeded683ms2356 KiB
119Time limit exceeded681ms2356 KiB
120Time limit exceeded683ms2360 KiB
121Time limit exceeded683ms2356 KiB
122Time limit exceeded686ms2360 KiB
123Time limit exceeded689ms2352 KiB
124Time limit exceeded689ms2268 KiB
125Time limit exceeded689ms2176 KiB
126Time limit exceeded688ms2356 KiB
127Time limit exceeded689ms2356 KiB