oj.uz

Submission #223080

# Submission time Handle Problem Language Result Execution time Memory
223080 2020-04-14T16:49:24 Z MKopchev Cloud Computing (CEOI18_clo) C++14
100 / 100
 851 ms 2168 KB 
#include<bits/stdc++.h>
using namespace std;
const int MX=50*2000+42,nmax=2e3+42;
const long long inf=1e18;

struct comp
{
    int cores,rate,gain;
};
comp inp[nmax*2];

int n,m;

long long dp[2][MX];

void my_clean(int id)
{
    for(int i=0;i<MX;i++)
        dp[id][i]=-inf;
}

void add(int which)
{
    //ignore
    for(int i=0;i<MX;i++)
        dp[which&1][i]=dp[!(which&1)][i];

    //take
    for(int i=0;i<MX;i++)
    {
        int would=i+inp[which].cores;
        if(0<=would&&would<MX)dp[which&1][would]=max(dp[which&1][would],dp[!(which&1)][i]+inp[which].gain);
    }
}

bool cmp(comp a,comp b)
{
    if(a.rate!=b.rate)return a.rate>b.rate;
    return a.cores>b.cores;
}
int main()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
        inp[i].gain=-inp[i].gain;
    }

    my_clean(0);
    my_clean(1);

    dp[0][0]=0;

    scanf("%i",&m);

    for(int i=n+1;i<=n+m;i++)
    {
        scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
        inp[i].cores=-inp[i].cores;
    }

    n=n+m;

    sort(inp+1,inp+n+1,cmp);

    for(int i=1;i<=n;i++)
        add(i);

    long long output=0;

    for(int i=0;i<MX;i++)
        output=max(output,dp[n%2][i]);

    printf("%lld\n",output);
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
clo.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&m);
     ~~~~~^~~~~~~~~
clo.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i%i",&inp[i].cores,&inp[i].rate,&inp[i].gain);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 28 ms 1920 KB Output is correct
4 Correct 48 ms 1920 KB Output is correct
5 Correct 420 ms 1912 KB Output is correct
6 Correct 405 ms 2040 KB Output is correct
7 Correct 445 ms 1920 KB Output is correct
8 Correct 421 ms 1920 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1920 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 28 ms 1920 KB Output is correct
4 Correct 34 ms 2040 KB Output is correct
5 Correct 196 ms 1920 KB Output is correct
6 Correct 227 ms 2040 KB Output is correct
7 Correct 424 ms 1920 KB Output is correct
8 Correct 432 ms 1992 KB Output is correct
9 Correct 419 ms 1920 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1920 KB Output is correct
2 Correct 12 ms 1920 KB Output is correct
3 Correct 43 ms 1920 KB Output is correct
4 Correct 47 ms 1920 KB Output is correct
5 Correct 81 ms 1920 KB Output is correct
6 Correct 80 ms 1920 KB Output is correct
7 Correct 114 ms 1920 KB Output is correct
8 Correct 109 ms 1920 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1920 KB Output is correct
2 Correct 9 ms 1920 KB Output is correct
3 Correct 332 ms 2040 KB Output is correct
4 Correct 416 ms 1920 KB Output is correct
5 Correct 813 ms 2040 KB Output is correct
6 Correct 837 ms 2040 KB Output is correct
7 Correct 839 ms 2040 KB Output is correct
8 Correct 820 ms 2040 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1920 KB Output is correct
2 Correct 39 ms 1920 KB Output is correct
3 Correct 177 ms 1920 KB Output is correct
4 Correct 430 ms 1920 KB Output is correct
5 Correct 832 ms 2040 KB Output is correct
6 Correct 837 ms 1920 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1920 KB Output is correct
2 Correct 6 ms 1920 KB Output is correct
3 Correct 28 ms 1920 KB Output is correct
4 Correct 48 ms 1920 KB Output is correct
5 Correct 420 ms 1912 KB Output is correct
6 Correct 405 ms 2040 KB Output is correct
7 Correct 445 ms 1920 KB Output is correct
8 Correct 421 ms 1920 KB Output is correct
9 Correct 10 ms 1920 KB Output is correct
10 Correct 8 ms 1920 KB Output is correct
11 Correct 28 ms 1920 KB Output is correct
12 Correct 34 ms 2040 KB Output is correct
13 Correct 196 ms 1920 KB Output is correct
14 Correct 227 ms 2040 KB Output is correct
15 Correct 424 ms 1920 KB Output is correct
16 Correct 432 ms 1992 KB Output is correct
17 Correct 419 ms 1920 KB Output is correct
18 Correct 12 ms 1920 KB Output is correct
19 Correct 12 ms 1920 KB Output is correct
20 Correct 43 ms 1920 KB Output is correct
21 Correct 47 ms 1920 KB Output is correct
22 Correct 81 ms 1920 KB Output is correct
23 Correct 80 ms 1920 KB Output is correct
24 Correct 114 ms 1920 KB Output is correct
25 Correct 109 ms 1920 KB Output is correct
26 Correct 9 ms 1920 KB Output is correct
27 Correct 9 ms 1920 KB Output is correct
28 Correct 332 ms 2040 KB Output is correct
29 Correct 416 ms 1920 KB Output is correct
30 Correct 813 ms 2040 KB Output is correct
31 Correct 837 ms 2040 KB Output is correct
32 Correct 839 ms 2040 KB Output is correct
33 Correct 820 ms 2040 KB Output is correct
34 Correct 7 ms 1920 KB Output is correct
35 Correct 39 ms 1920 KB Output is correct
36 Correct 177 ms 1920 KB Output is correct
37 Correct 430 ms 1920 KB Output is correct
38 Correct 832 ms 2040 KB Output is correct
39 Correct 837 ms 1920 KB Output is correct
40 Correct 217 ms 1920 KB Output is correct
41 Correct 416 ms 1912 KB Output is correct
42 Correct 639 ms 1920 KB Output is correct
43 Correct 845 ms 2040 KB Output is correct
44 Correct 833 ms 2040 KB Output is correct
45 Correct 851 ms 2168 KB Output is correct
46 Correct 428 ms 2040 KB Output is correct
47 Correct 631 ms 1920 KB Output is correct
48 Correct 614 ms 2016 KB Output is correct