196272025-12-17 12:24:27szabel26Munkákcpp17Time limit exceeded 50/80688ms3960 KiB
// munkak.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
using namespace std;

struct adat {
    int sorszam = 0, penz = 0;
};

vector<adat>napok;
vector<int>sol;
vector<int>sol2;
vector<int>lehetseges(0, 0);

int n, m, maxi = 0;

void check(int ossz)
{
    if (ossz > maxi)
    {
        maxi = ossz;
        sol2 = sol;
    }
}

void backtrack(int akt, int ossz)
{
    if (ossz + lehetseges[akt] <= maxi)
    {
        return;
    }

    ossz += napok[akt].penz;
    sol.push_back(napok[akt].sorszam);
    if (akt + 2 <= n)
    {
        for (int i = akt + 2; i <= n; ++i)
        {
            if (napok[i].sorszam != 0) backtrack(i, ossz);
        }
    }
    check(ossz);
    if (!sol.empty()) sol.pop_back();
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    napok.resize(n + 1);
    lehetseges.resize(n + 2);

    int a;
    adat b;
    for (int i = 1; i <= m; ++i)
    {
        cin >> a >> b.penz;
        b.sorszam = i;
        if(napok[a].penz <= b.penz) napok[a] = b;
        if (a > maxi) maxi = a;
    }

    n = maxi;
    napok.resize(n + 1);
    maxi = 0;

    for (int i = n; i >= 1; --i)
    {
        lehetseges[i] = lehetseges[i + 1] + napok[i].penz;
    }

    for (int i = 1; i <= n; ++i) if (napok[i].sorszam != 0) backtrack(i, 0);

    cout << maxi << " " << sol2.size() << endl;
    for (auto& e : sol2)
    {
        cout << e << " ";
    }
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms508 KiB
2Time limit exceeded688ms588 KiB
subtask210/10
3Accepted1ms316 KiB
4Accepted1ms508 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
subtask310/10
8Accepted1ms316 KiB
9Accepted1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms508 KiB
12Accepted1ms316 KiB
subtask410/10
13Accepted1ms316 KiB
14Accepted1ms508 KiB
15Accepted1ms316 KiB
16Accepted1ms316 KiB
17Accepted1ms316 KiB
18Accepted1ms316 KiB
19Accepted1ms316 KiB
20Accepted1ms508 KiB
21Accepted1ms316 KiB
22Accepted1ms316 KiB
subtask510/10
23Accepted1ms316 KiB
24Accepted1ms316 KiB
25Accepted1ms316 KiB
26Accepted1ms508 KiB
27Accepted1ms316 KiB
28Accepted2ms508 KiB
29Accepted1ms316 KiB
30Accepted2ms316 KiB
31Accepted1ms316 KiB
32Accepted1ms316 KiB
subtask610/10
33Accepted1ms316 KiB
34Accepted1ms508 KiB
35Accepted1ms316 KiB
36Accepted1ms316 KiB
37Accepted1ms316 KiB
38Accepted1ms316 KiB
39Accepted1ms316 KiB
40Accepted1ms316 KiB
41Accepted1ms508 KiB
42Accepted1ms316 KiB
43Accepted1ms316 KiB
44Accepted1ms316 KiB
45Accepted1ms508 KiB
46Accepted1ms316 KiB
47Accepted1ms316 KiB
48Accepted2ms508 KiB
49Accepted1ms316 KiB
50Accepted2ms316 KiB
51Accepted1ms316 KiB
52Accepted1ms316 KiB
53Accepted2ms316 KiB
54Accepted18ms316 KiB
55Accepted2ms508 KiB
56Accepted28ms528 KiB
57Accepted153ms316 KiB
subtask70/10
58Accepted1ms316 KiB
59Accepted1ms508 KiB
60Accepted1ms316 KiB
61Accepted1ms316 KiB
62Accepted1ms316 KiB
63Accepted1ms316 KiB
64Accepted1ms316 KiB
65Accepted1ms316 KiB
66Accepted1ms508 KiB
67Accepted1ms316 KiB
68Accepted1ms316 KiB
69Accepted1ms316 KiB
70Accepted1ms508 KiB
71Accepted1ms316 KiB
72Accepted1ms316 KiB
73Accepted2ms508 KiB
74Accepted1ms316 KiB
75Accepted2ms316 KiB
76Accepted1ms316 KiB
77Accepted1ms316 KiB
78Accepted2ms316 KiB
79Accepted18ms316 KiB
80Accepted2ms508 KiB
81Accepted28ms528 KiB
82Accepted153ms316 KiB
83Time limit exceeded677ms2100 KiB
84Time limit exceeded677ms2100 KiB
85Time limit exceeded677ms2100 KiB
86Time limit exceeded677ms2100 KiB
87Time limit exceeded680ms2100 KiB
subtask80/20
88Accepted1ms316 KiB
89Accepted1ms508 KiB
90Accepted1ms316 KiB
91Accepted1ms316 KiB
92Accepted1ms316 KiB
93Accepted1ms316 KiB
94Accepted1ms316 KiB
95Accepted1ms316 KiB
96Accepted1ms508 KiB
97Accepted1ms316 KiB
98Accepted1ms316 KiB
99Accepted1ms316 KiB
100Accepted1ms508 KiB
101Accepted1ms316 KiB
102Accepted1ms316 KiB
103Accepted2ms508 KiB
104Accepted1ms316 KiB
105Accepted2ms316 KiB
106Accepted1ms316 KiB
107Accepted1ms316 KiB
108Accepted2ms316 KiB
109Accepted18ms316 KiB
110Accepted2ms508 KiB
111Accepted28ms528 KiB
112Accepted153ms316 KiB
113Time limit exceeded677ms2100 KiB
114Time limit exceeded677ms2100 KiB
115Time limit exceeded677ms2100 KiB
116Time limit exceeded677ms2100 KiB
117Time limit exceeded680ms2100 KiB
118Time limit exceeded685ms3960 KiB
119Time limit exceeded685ms3764 KiB
120Time limit exceeded685ms3764 KiB
121Time limit exceeded685ms3640 KiB
122Time limit exceeded670ms3764 KiB
123Time limit exceeded670ms3764 KiB
124Time limit exceeded670ms3764 KiB
125Time limit exceeded671ms3764 KiB
126Time limit exceeded676ms3764 KiB
127Time limit exceeded677ms3764 KiB