oj.uz

Submission #596031

# Submission time Handle Problem Language Result Execution time Memory
596031 2022-07-14T09:24:56 Z Hanksburger Cloud Computing (CEOI18_clo) C++17
100 / 100
 581 ms 2008 KB 
#include <bits/stdc++.h>
using namespace std;
pair<pair<int, int>, int> a[4005];
long long dp[100005], tmp[100005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n;
    for (int i=1; i<=n; i++)
    {
        cin >> a[i].first.second >> a[i].first.first >> a[i].second;
        a[i].second*=-1;
    }
    cin >> m;
    for (int i=n+1; i<=n+m; i++)
    {
        cin >> a[i].first.second >> a[i].first.first >> a[i].second;
        a[i].first.second*=-1;
    }
    sort(a+1, a+n+m+1, greater<pair<pair<int, int>, int> >());
    for (int i=1; i<=1e5; i++)
        dp[i]=-1e18;
    for (int i=1; i<=n+m; i++)
    {
        for (int j=0; j<=1e5; j++)
        {
            if (j-a[i].first.second>=0 && j-a[i].first.second<=1e5)
                tmp[j]=max(dp[j], dp[j-a[i].first.second]+a[i].second);
            else
                tmp[j]=dp[j];
        }
//        cout << "i=" << i << ": " << a[i].second << ' ' << a[i].first.first << ' ' << a[i].first.second << '\n';
        for (int j=0; j<=1e5; j++)
        {
            dp[j]=tmp[j];
//            if (j<=15)
//                cout << dp[j] << ' ';
        }
//        cout << '\n';
    }
    long long ans=0;
    for (int i=0; i<=1e5; i++)
        ans=max(ans, dp[i]);
    cout << ans;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 19 ms 1896 KB Output is correct
4 Correct 36 ms 1876 KB Output is correct
5 Correct 300 ms 1932 KB Output is correct
6 Correct 310 ms 1936 KB Output is correct
7 Correct 353 ms 1940 KB Output is correct
8 Correct 315 ms 1916 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 3 ms 1876 KB Output is correct
3 Correct 18 ms 1876 KB Output is correct
4 Correct 18 ms 1876 KB Output is correct
5 Correct 136 ms 1876 KB Output is correct
6 Correct 158 ms 1896 KB Output is correct
7 Correct 302 ms 1996 KB Output is correct
8 Correct 287 ms 1940 KB Output is correct
9 Correct 280 ms 1912 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1876 KB Output is correct
2 Correct 5 ms 1876 KB Output is correct
3 Correct 29 ms 1896 KB Output is correct
4 Correct 26 ms 1876 KB Output is correct
5 Correct 56 ms 1892 KB Output is correct
6 Correct 57 ms 1892 KB Output is correct
7 Correct 69 ms 1996 KB Output is correct
8 Correct 69 ms 1892 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 3 ms 1896 KB Output is correct
3 Correct 207 ms 1900 KB Output is correct
4 Correct 247 ms 1920 KB Output is correct
5 Correct 503 ms 1972 KB Output is correct
6 Correct 574 ms 1960 KB Output is correct
7 Correct 539 ms 1968 KB Output is correct
8 Correct 536 ms 1960 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 27 ms 1868 KB Output is correct
3 Correct 120 ms 1892 KB Output is correct
4 Correct 279 ms 1876 KB Output is correct
5 Correct 533 ms 1972 KB Output is correct
6 Correct 559 ms 1948 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 19 ms 1896 KB Output is correct
4 Correct 36 ms 1876 KB Output is correct
5 Correct 300 ms 1932 KB Output is correct
6 Correct 310 ms 1936 KB Output is correct
7 Correct 353 ms 1940 KB Output is correct
8 Correct 315 ms 1916 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
11 Correct 18 ms 1876 KB Output is correct
12 Correct 18 ms 1876 KB Output is correct
13 Correct 136 ms 1876 KB Output is correct
14 Correct 158 ms 1896 KB Output is correct
15 Correct 302 ms 1996 KB Output is correct
16 Correct 287 ms 1940 KB Output is correct
17 Correct 280 ms 1912 KB Output is correct
18 Correct 6 ms 1876 KB Output is correct
19 Correct 5 ms 1876 KB Output is correct
20 Correct 29 ms 1896 KB Output is correct
21 Correct 26 ms 1876 KB Output is correct
22 Correct 56 ms 1892 KB Output is correct
23 Correct 57 ms 1892 KB Output is correct
24 Correct 69 ms 1996 KB Output is correct
25 Correct 69 ms 1892 KB Output is correct
26 Correct 4 ms 1876 KB Output is correct
27 Correct 3 ms 1896 KB Output is correct
28 Correct 207 ms 1900 KB Output is correct
29 Correct 247 ms 1920 KB Output is correct
30 Correct 503 ms 1972 KB Output is correct
31 Correct 574 ms 1960 KB Output is correct
32 Correct 539 ms 1968 KB Output is correct
33 Correct 536 ms 1960 KB Output is correct
34 Correct 2 ms 1876 KB Output is correct
35 Correct 27 ms 1868 KB Output is correct
36 Correct 120 ms 1892 KB Output is correct
37 Correct 279 ms 1876 KB Output is correct
38 Correct 533 ms 1972 KB Output is correct
39 Correct 559 ms 1948 KB Output is correct
40 Correct 154 ms 2004 KB Output is correct
41 Correct 285 ms 1920 KB Output is correct
42 Correct 423 ms 1876 KB Output is correct
43 Correct 564 ms 1972 KB Output is correct
44 Correct 581 ms 1980 KB Output is correct
45 Correct 569 ms 2008 KB Output is correct
46 Correct 297 ms 1920 KB Output is correct
47 Correct 409 ms 1952 KB Output is correct
48 Correct 424 ms 1952 KB Output is correct