oj.uz

Submission #496597

# Submission time Handle Problem Language Result Execution time Memory
496597 2021-12-21T15:40:00 Z DDTerziev04 Cloud Computing (CEOI18_clo) C++14
72 / 100
 993 ms 1988 KB 
#include<iostream>
#include<tuple>
#include<vector>
#include<algorithm>
using namespace std;

const int MAXN=2000, MAXC=50;
const long long INF=1e15;

bool CompareTuples(tuple<int, int, int> a, tuple<int, int, int> b)
{
    return get<1>(a)>get<1>(b);
}

tuple<int, int, int> p[2*MAXN];
long long dp[2][MAXN*MAXC+1];

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

    int n;
    cin >> n;

    for(int i=0; i<n; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;

        p[i]={c, f, -v};
    }

    int m;
    cin >> m;

    for(int i=n; i<n+m; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;

        p[i]={-c, f, v};
    }
    sort(p, p+n+m, CompareTuples);

    for(int j=0; j<=n*MAXC; j++)
    {
        dp[0][j]=-INF, dp[1][j]=-INF;
    }
    dp[0][0]=0;

    long long ans=0;
    for(int i=0; i<n+m; i++)
    {
        for(int j=0; j<=n*MAXC; j++)
        {
            int c, f, v;
            tie(c, f, v)=p[i];

            dp[1][j]=max(dp[1][j], dp[0][j]);
            if(j+c>=0 && j+c<=n*MAXC)
            {
                dp[1][j+c]=max(dp[1][j+c], dp[0][j]+v);
            }

            ans=max(ans, dp[0][j]);
        }

        for(int j=0; j<=n*MAXC; j++)
        {
            dp[0][j]=dp[1][j], dp[1][j]=-INF;
        }
    }

    for(int i=0; i<=MAXC; i++)
    {
        ans=max(ans, dp[0][i]);
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 5 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 100 ms 1032 KB Output is correct
6 Correct 108 ms 1036 KB Output is correct
7 Correct 528 ms 1884 KB Output is correct
8 Correct 513 ms 1888 KB Output is correct
9 Correct 480 ms 1740 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 11 ms 512 KB Output is correct
6 Correct 11 ms 460 KB Output is correct
7 Correct 18 ms 564 KB Output is correct
8 Correct 18 ms 532 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 291 ms 1516 KB Output is correct
4 Incorrect 4 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 58 ms 716 KB Output is correct
4 Correct 209 ms 972 KB Output is correct
5 Correct 984 ms 1988 KB Output is correct
6 Correct 993 ms 1916 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 100 ms 1032 KB Output is correct
14 Correct 108 ms 1036 KB Output is correct
15 Correct 528 ms 1884 KB Output is correct
16 Correct 513 ms 1888 KB Output is correct
17 Correct 480 ms 1740 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 11 ms 512 KB Output is correct
23 Correct 11 ms 460 KB Output is correct
24 Correct 18 ms 564 KB Output is correct
25 Correct 18 ms 532 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 291 ms 1516 KB Output is correct
29 Incorrect 4 ms 364 KB Output isn't correct
30 Halted 0 ms 0 KB -