199852025-12-30 21:33:12VargaVivienVárosnézéscpp17Time limit exceeded 20/801.11s262144 KiB
#include <iostream>
#include <vector>
#include <string>

using namespace std;

struct ut
{
    int bol, ba;
};

bool latogatas(int varos, int *latvanyossag, int *db, vector<vector<int>> terkep, int n, vector<int> &szam)
{
    bool vege = false;
    vector<int> maximum;
    vector<int> temp;
    int maxi = 0;
   // cout << "szam" << &szam << endl;
   // cout << "temp" << &temp << endl;
    if(varos == n)
    {
        vege = true;
        *db += latvanyossag[varos - 1];
        szam.push_back(varos);
        return vege;
    }
    else
    {
        int reszdb;
        szam.push_back(varos);
        for(int i = 0; i < terkep[varos].size(); i++)
        {

            reszdb = *db + latvanyossag[varos - 1];
            temp.clear();

                if(latogatas(terkep[varos][i], latvanyossag, &reszdb, terkep, n, temp))
                {
                    vege = true;
                    if(reszdb > maxi)
                    {
                        maxi = reszdb;
                        maximum.clear();
                        for(int j : temp)
                        {
                        //    cout << temp[j] <<endl;
                            maximum.push_back(j);
                        }
                    }
                }

        }
        if(!vege)
        {
            szam.pop_back();
        }
        else
        {
            for(int j:maximum)
            {
                szam.push_back(j);
            }
        }
        *db = maxi;
        return vege;
    }
}

int main()
{
    int n, m;
    ut x;
    cin >> x.bol >> x.ba;
    n = x.bol;
    m = x.ba;
    int numbers[n];
    for(int i=0; i<n; i++) cin >> numbers[i];

    vector <vector<int>> terkep(n+1);

    for(int i = 0; i < m; i++)
    {
        cin >> x.bol >> x.ba;
        terkep[x.bol].push_back(x.ba);

    }
    int db = 0;
    vector<int> szam;
    if (latogatas(1, numbers, &db, terkep, n, szam))
    {
        cout << db << endl;
        //cout << szam.size()<< endl;
        for (int j:szam)
        {
            cout << j << " ";
        }
    }
    else
    {
        cout << -1 << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
subtask20/20
2Accepted1ms316 KiB
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Time limit exceeded1.08s6336 KiB
6Accepted188ms2840 KiB
7Time limit exceeded1.101s37668 KiB
8Time limit exceeded1.1s37160 KiB
9Accepted1ms508 KiB
10Runtime error365ms262144 KiB
11Accepted1ms316 KiB
12Accepted1ms316 KiB
subtask30/25
13Accepted2ms316 KiB
14Accepted2ms508 KiB
15Accepted2ms316 KiB
16Accepted32ms316 KiB
17Accepted1ms316 KiB
18Accepted6ms416 KiB
19Accepted1ms316 KiB
20Accepted1ms316 KiB
21Accepted1ms316 KiB
22Time limit exceeded1.1s912 KiB
23Accepted2ms316 KiB
24Time limit exceeded1.098s1076 KiB
25Time limit exceeded1.1s752 KiB
26Accepted2ms316 KiB
27Accepted4ms316 KiB
28Time limit exceeded1.1s6332 KiB
29Time limit exceeded1.085s2076 KiB
30Time limit exceeded1.1s8892 KiB
31Accepted17ms1336 KiB
32Accepted32ms1332 KiB
33Accepted9ms1192 KiB
subtask420/20
34Accepted1ms316 KiB
35Accepted1ms316 KiB
36Accepted1ms512 KiB
37Accepted1ms316 KiB
38Accepted14ms416 KiB
39Accepted1ms316 KiB
40Accepted6ms424 KiB
41Accepted1ms316 KiB
42Accepted1ms316 KiB
43Accepted1ms316 KiB
44Accepted14ms412 KiB
45Accepted1ms316 KiB
46Accepted280ms432 KiB
47Accepted3ms416 KiB
48Accepted1ms316 KiB
49Accepted4ms316 KiB
50Accepted1ms316 KiB
51Accepted1ms316 KiB
52Accepted1ms348 KiB
53Accepted1ms316 KiB
54Accepted1ms316 KiB
55Accepted1ms556 KiB
56Accepted1ms316 KiB
57Accepted1ms356 KiB
58Accepted1ms532 KiB
59Accepted1ms316 KiB
60Accepted1ms316 KiB
61Accepted1ms508 KiB
62Accepted1ms316 KiB
63Accepted1ms316 KiB
64Accepted1ms316 KiB
65Accepted1ms508 KiB
66Accepted2ms316 KiB
subtask50/15
67Accepted1ms316 KiB
68Accepted1ms316 KiB
69Accepted1ms316 KiB
70Accepted1ms316 KiB
71Time limit exceeded1.08s6336 KiB
72Accepted188ms2840 KiB
73Time limit exceeded1.101s37668 KiB
74Time limit exceeded1.1s37160 KiB
75Accepted1ms508 KiB
76Runtime error365ms262144 KiB
77Accepted1ms316 KiB
78Accepted1ms316 KiB
79Accepted2ms316 KiB
80Accepted2ms508 KiB
81Accepted2ms316 KiB
82Accepted32ms316 KiB
83Accepted1ms316 KiB
84Accepted6ms416 KiB
85Accepted1ms316 KiB
86Accepted1ms316 KiB
87Accepted1ms316 KiB
88Time limit exceeded1.1s912 KiB
89Accepted2ms316 KiB
90Time limit exceeded1.098s1076 KiB
91Time limit exceeded1.1s752 KiB
92Accepted2ms316 KiB
93Accepted4ms316 KiB
94Time limit exceeded1.1s6332 KiB
95Time limit exceeded1.085s2076 KiB
96Time limit exceeded1.1s8892 KiB
97Accepted17ms1336 KiB
98Accepted32ms1332 KiB
99Accepted9ms1192 KiB
100Accepted1ms316 KiB
101Accepted1ms512 KiB
102Accepted1ms316 KiB
103Accepted14ms416 KiB
104Accepted1ms316 KiB
105Accepted6ms424 KiB
106Accepted1ms316 KiB
107Accepted1ms316 KiB
108Accepted1ms316 KiB
109Accepted14ms412 KiB
110Accepted1ms316 KiB
111Accepted280ms432 KiB
112Accepted3ms416 KiB
113Accepted1ms316 KiB
114Accepted4ms316 KiB
115Accepted1ms316 KiB
116Accepted1ms316 KiB
117Accepted1ms348 KiB
118Accepted1ms316 KiB
119Accepted1ms316 KiB
120Accepted1ms556 KiB
121Accepted1ms316 KiB
122Accepted1ms356 KiB
123Accepted1ms532 KiB
124Accepted1ms316 KiB
125Accepted1ms316 KiB
126Accepted1ms508 KiB
127Accepted1ms316 KiB
128Accepted1ms316 KiB
129Accepted1ms316 KiB
130Accepted1ms508 KiB
131Accepted2ms316 KiB
132Time limit exceeded1.082s820 KiB
133Accepted2ms508 KiB
134Time limit exceeded1.082s1108 KiB
135Time limit exceeded1.082s820 KiB
136Time limit exceeded1.1s820 KiB
137Time limit exceeded1.082s740 KiB
138Time limit exceeded1.083s820 KiB
139Accepted3ms500 KiB
140Time limit exceeded1.1s6408 KiB
141Accepted698ms15288 KiB
142Time limit exceeded1.085s15552 KiB
143Time limit exceeded1.075s57828 KiB
144Time limit exceeded1.075s45288 KiB
145Time limit exceeded1.11s166408 KiB
146Time limit exceeded1.09s83644 KiB
147Runtime error552ms262144 KiB
148Time limit exceeded1.095s179456 KiB
149Runtime error386ms262144 KiB