oj.uz

Submission #575630

# Submission time Handle Problem Language Result Execution time Memory
575630 2022-06-11T06:57:03 Z andrei_boaca Cloud Computing (CEOI18_clo) C++14
100 / 100
 775 ms 2124 KB 
#include <bits/stdc++.h>
#define CMAX 100000
using namespace std;
typedef long long ll;
ll n,m;
struct date
{
    int tip;
    ll c,f,p;
} v[5005];
ll dp[2][CMAX+5];
bool comp(date a, date b)
{
    if(a.f!=b.f)
        return a.f>b.f;
    return a.tip<b.tip;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        v[i].tip=1;
        cin>>v[i].c>>v[i].f>>v[i].p;
    }
    cin>>m;
    for(int i=1;i<=m;i++)
    {
        v[i+n].tip=2;
        cin>>v[i+n].c>>v[i+n].f>>v[i+n].p;
    }
    sort(v+1,v+n+m+1,comp);
    for(int i=1;i<=CMAX;i++)
        dp[0][i]=-1e17;
    ll ans=0;
    for(int i=1;i<=n+m;i++)
    {
        for(int c=0;c<=CMAX;c++)
        {
            dp[1][c]=dp[0][c];
            if(v[i].tip==1)
            {
                if(c>=v[i].c)
                    dp[1][c]=max(dp[1][c],dp[0][c-v[i].c]-v[i].p);
            }
            else
            {
                if(c+v[i].c<=CMAX)
                    dp[1][c]=max(dp[1][c],dp[0][c+v[i].c]+v[i].p);
            }
            ans=max(ans,dp[1][c]);
        }
        for(int c=0;c<=CMAX;c++)
            dp[0][c]=dp[1][c];
    }
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 27 ms 1888 KB Output is correct
4 Correct 48 ms 1876 KB Output is correct
5 Correct 386 ms 1928 KB Output is correct
6 Correct 406 ms 1924 KB Output is correct
7 Correct 404 ms 1932 KB Output is correct
8 Correct 392 ms 1996 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 21 ms 1836 KB Output is correct
4 Correct 22 ms 1892 KB Output is correct
5 Correct 175 ms 1876 KB Output is correct
6 Correct 175 ms 1996 KB Output is correct
7 Correct 351 ms 1876 KB Output is correct
8 Correct 354 ms 1940 KB Output is correct
9 Correct 338 ms 1928 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 6 ms 1876 KB Output is correct
3 Correct 44 ms 1876 KB Output is correct
4 Correct 33 ms 1876 KB Output is correct
5 Correct 69 ms 1880 KB Output is correct
6 Correct 70 ms 1884 KB Output is correct
7 Correct 92 ms 1876 KB Output is correct
8 Correct 93 ms 1884 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 4 ms 1884 KB Output is correct
3 Correct 269 ms 1996 KB Output is correct
4 Correct 332 ms 1928 KB Output is correct
5 Correct 674 ms 2004 KB Output is correct
6 Correct 716 ms 2036 KB Output is correct
7 Correct 737 ms 2004 KB Output is correct
8 Correct 696 ms 2004 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 35 ms 1876 KB Output is correct
3 Correct 157 ms 1912 KB Output is correct
4 Correct 358 ms 1876 KB Output is correct
5 Correct 775 ms 2124 KB Output is correct
6 Correct 718 ms 2004 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 27 ms 1888 KB Output is correct
4 Correct 48 ms 1876 KB Output is correct
5 Correct 386 ms 1928 KB Output is correct
6 Correct 406 ms 1924 KB Output is correct
7 Correct 404 ms 1932 KB Output is correct
8 Correct 392 ms 1996 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
11 Correct 21 ms 1836 KB Output is correct
12 Correct 22 ms 1892 KB Output is correct
13 Correct 175 ms 1876 KB Output is correct
14 Correct 175 ms 1996 KB Output is correct
15 Correct 351 ms 1876 KB Output is correct
16 Correct 354 ms 1940 KB Output is correct
17 Correct 338 ms 1928 KB Output is correct
18 Correct 6 ms 1876 KB Output is correct
19 Correct 6 ms 1876 KB Output is correct
20 Correct 44 ms 1876 KB Output is correct
21 Correct 33 ms 1876 KB Output is correct
22 Correct 69 ms 1880 KB Output is correct
23 Correct 70 ms 1884 KB Output is correct
24 Correct 92 ms 1876 KB Output is correct
25 Correct 93 ms 1884 KB Output is correct
26 Correct 4 ms 1876 KB Output is correct
27 Correct 4 ms 1884 KB Output is correct
28 Correct 269 ms 1996 KB Output is correct
29 Correct 332 ms 1928 KB Output is correct
30 Correct 674 ms 2004 KB Output is correct
31 Correct 716 ms 2036 KB Output is correct
32 Correct 737 ms 2004 KB Output is correct
33 Correct 696 ms 2004 KB Output is correct
34 Correct 2 ms 1876 KB Output is correct
35 Correct 35 ms 1876 KB Output is correct
36 Correct 157 ms 1912 KB Output is correct
37 Correct 358 ms 1876 KB Output is correct
38 Correct 775 ms 2124 KB Output is correct
39 Correct 718 ms 2004 KB Output is correct
40 Correct 243 ms 1876 KB Output is correct
41 Correct 356 ms 1952 KB Output is correct
42 Correct 635 ms 2004 KB Output is correct
43 Correct 701 ms 1996 KB Output is correct
44 Correct 724 ms 2072 KB Output is correct
45 Correct 712 ms 2084 KB Output is correct
46 Correct 366 ms 1880 KB Output is correct
47 Correct 538 ms 2004 KB Output is correct
48 Correct 525 ms 2008 KB Output is correct