oj.uz

Submission #471326

# Submission time Handle Problem Language Result Execution time Memory
471326 2021-09-08T12:08:57 Z ascyrax Knapsack (NOI18_knapsack) C++17
100 / 100
 101 ms 35140 KB 
// @author: ascyrax

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

#define endl "\n"
#define ioss                     \
    ios::sync_with_stdio(false); \
    cin.tie(0);
#define pb push_back

double startTime;
double gct() //get_current_time
{
    return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
void suraj();

int main()
{
    ioss
        startTime = (double)clock();
    //freopen("shell.in","r",stdin);freopen("shell.out","w",stdout);
    //cout << setprecision(15) << fixed << endl;
    //int t;cin>>t;for(int i=1;i<=t;i++)
    {
        //cout<<"Case #"<<i<<": ";
        suraj();
    }
    return 0;
}

const ll MOD = 1e9 + 7;
const int INF = int(1e9);
const int NEG_INF = int(-1e9);
//const int INF = 2147483647;
//const int NEG_INF = -2147483647 - 1;
//............................... dont declare any variable named y1 or (y2 maybe) as it is already present in some library and they may collide

//...............................

//...............................
//N- 1e5
//v- 1e6
//S- 2000
//k- 1e9

void suraj()
{
    int s, n;
    cin >> s >> n;
    vector<vector<pair<int, int>>> by_weight(s + 1);
    for (int i = 0; i < n; i++)
    {
        int v, w, q;
        cin >> v >> w >> q;
        by_weight[w].pb(make_pair(v, q));
    }

    for (int i = 0; i <= s; i++)
    {
        sort(by_weight[i].rbegin(), by_weight[i].rend());
    }

    vector<vector<ll>> best(s + 1, vector<ll>(s + 1, 0ll));
    //best[i][j] => max value obtained if from the first i weight, objects of total weight of j is chosen
    for (int i = 1; i <= s; i++)
    {
        for (int j = 1; j <= s; j++)
        {
            best[i][j] = max(best[i][j], best[i - 1][j]); //if no objects with weight i was taken
            ll totW = 0, totV = 0;
            // while (totW <= j)
            // {
            int flag = 0;
            //if objects with weight i were taken
            for (auto vq : by_weight[i])
            {
                ll nvq = vq.second;
                while (nvq--)
                {
                    totW += i;
                    totV += vq.first;
                    if (j - totW >= 0)
                        best[i][j] = max(best[i][j], best[i - 1][j - totW] + totV);
                    else
                    {
                        flag = -1;
                        break;
                    }
                }
                if (flag == -1)
                    break;
            }
            // }
        }
    }
    cout << best[s][s] << endl;
}

//................................

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12236 KB Output is correct
2 Correct 8 ms 12236 KB Output is correct
3 Correct 9 ms 12236 KB Output is correct
4 Correct 8 ms 12236 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 25 ms 31780 KB Output is correct
3 Correct 21 ms 31692 KB Output is correct
4 Correct 20 ms 31544 KB Output is correct
5 Correct 21 ms 31552 KB Output is correct
6 Correct 26 ms 31748 KB Output is correct
7 Correct 27 ms 31700 KB Output is correct
8 Correct 22 ms 31708 KB Output is correct
9 Correct 21 ms 31692 KB Output is correct
10 Correct 22 ms 31692 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 25 ms 31780 KB Output is correct
3 Correct 21 ms 31692 KB Output is correct
4 Correct 20 ms 31544 KB Output is correct
5 Correct 21 ms 31552 KB Output is correct
6 Correct 26 ms 31748 KB Output is correct
7 Correct 27 ms 31700 KB Output is correct
8 Correct 22 ms 31708 KB Output is correct
9 Correct 21 ms 31692 KB Output is correct
10 Correct 22 ms 31692 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 24 ms 31668 KB Output is correct
13 Correct 23 ms 31636 KB Output is correct
14 Correct 21 ms 31692 KB Output is correct
15 Correct 22 ms 31660 KB Output is correct
16 Correct 22 ms 31692 KB Output is correct
17 Correct 22 ms 31668 KB Output is correct
18 Correct 22 ms 31692 KB Output is correct
19 Correct 25 ms 31692 KB Output is correct
20 Correct 22 ms 31692 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12236 KB Output is correct
2 Correct 8 ms 12236 KB Output is correct
3 Correct 9 ms 12236 KB Output is correct
4 Correct 8 ms 12236 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 25 ms 31780 KB Output is correct
7 Correct 21 ms 31692 KB Output is correct
8 Correct 20 ms 31544 KB Output is correct
9 Correct 21 ms 31552 KB Output is correct
10 Correct 26 ms 31748 KB Output is correct
11 Correct 27 ms 31700 KB Output is correct
12 Correct 22 ms 31708 KB Output is correct
13 Correct 21 ms 31692 KB Output is correct
14 Correct 22 ms 31692 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 24 ms 31668 KB Output is correct
17 Correct 23 ms 31636 KB Output is correct
18 Correct 21 ms 31692 KB Output is correct
19 Correct 22 ms 31660 KB Output is correct
20 Correct 22 ms 31692 KB Output is correct
21 Correct 22 ms 31668 KB Output is correct
22 Correct 22 ms 31692 KB Output is correct
23 Correct 25 ms 31692 KB Output is correct
24 Correct 22 ms 31692 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 24 ms 31716 KB Output is correct
27 Correct 22 ms 31724 KB Output is correct
28 Correct 22 ms 31728 KB Output is correct
29 Correct 21 ms 31696 KB Output is correct
30 Correct 30 ms 31744 KB Output is correct
31 Correct 29 ms 31692 KB Output is correct
32 Correct 22 ms 31720 KB Output is correct
33 Correct 22 ms 31660 KB Output is correct
34 Correct 22 ms 31728 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12236 KB Output is correct
2 Correct 8 ms 12236 KB Output is correct
3 Correct 9 ms 12236 KB Output is correct
4 Correct 8 ms 12236 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 25 ms 31780 KB Output is correct
7 Correct 21 ms 31692 KB Output is correct
8 Correct 20 ms 31544 KB Output is correct
9 Correct 21 ms 31552 KB Output is correct
10 Correct 26 ms 31748 KB Output is correct
11 Correct 27 ms 31700 KB Output is correct
12 Correct 22 ms 31708 KB Output is correct
13 Correct 21 ms 31692 KB Output is correct
14 Correct 22 ms 31692 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 24 ms 31668 KB Output is correct
17 Correct 23 ms 31636 KB Output is correct
18 Correct 21 ms 31692 KB Output is correct
19 Correct 22 ms 31660 KB Output is correct
20 Correct 22 ms 31692 KB Output is correct
21 Correct 22 ms 31668 KB Output is correct
22 Correct 22 ms 31692 KB Output is correct
23 Correct 25 ms 31692 KB Output is correct
24 Correct 22 ms 31692 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 24 ms 31716 KB Output is correct
27 Correct 22 ms 31724 KB Output is correct
28 Correct 22 ms 31728 KB Output is correct
29 Correct 21 ms 31696 KB Output is correct
30 Correct 30 ms 31744 KB Output is correct
31 Correct 29 ms 31692 KB Output is correct
32 Correct 22 ms 31720 KB Output is correct
33 Correct 22 ms 31660 KB Output is correct
34 Correct 22 ms 31728 KB Output is correct
35 Correct 35 ms 2364 KB Output is correct
36 Correct 69 ms 33832 KB Output is correct
37 Correct 65 ms 33628 KB Output is correct
38 Correct 60 ms 33840 KB Output is correct
39 Correct 65 ms 34484 KB Output is correct
40 Correct 93 ms 35012 KB Output is correct
41 Correct 101 ms 34112 KB Output is correct
42 Correct 87 ms 34148 KB Output is correct
43 Correct 89 ms 34244 KB Output is correct
44 Correct 87 ms 34124 KB Output is correct
45 Correct 69 ms 35140 KB Output is correct
46 Correct 64 ms 34380 KB Output is correct
47 Correct 68 ms 34988 KB Output is correct
48 Correct 76 ms 34884 KB Output is correct
49 Correct 60 ms 34636 KB Output is correct
50 Correct 90 ms 34628 KB Output is correct