oj.uz

Submission #503963

# Submission time Handle Problem Language Result Execution time Memory
503963 2022-01-09T10:03:20 Z krit3379 Cloud Computing (CEOI18_clo) C++14
100 / 100
 691 ms 1996 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 2005

struct A{
    int c,f,v;
    bool operator<(const A& o)const{
        if(f!=o.f)return f>o.f;
        return c>o.c;
    }
};

A a[2*N];
long long dp[2][100005],ans,nn=100000;

int main(){
    int n,m,i,j,k,now=0,prev,c,f,v;
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].v*=-1;
    scanf("%d",&m);
    for(i=n+1;i<=n+m;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].c*=-1;
    sort(a+1,a+n+m+1);
    n+=m;
    for(i=1;i<=nn;i++)dp[now][i]=-1e18;
    for(i=1;i<=n;i++){
        prev=now;
        now=1-now;
        c=a[i].c;
        f=a[i].f;
        v=a[i].v;
        for(j=0;j<=nn;j++)dp[now][j]=dp[prev][j];
        for(j=0;j<=nn;j++){
            if(j-c>=0&&j-c<=nn)dp[now][j]=max(dp[now][j],dp[prev][j-c]+v);
        }
    }
    for(i=0;i<=nn;i++)ans=max(ans,dp[now][i]);
    printf("%lld",ans);
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:17:17: warning: unused variable 'k' [-Wunused-variable]
   17 |     int n,m,i,j,k,now=0,prev,c,f,v;
      |                 ^
clo.cpp:17:32: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   17 |     int n,m,i,j,k,now=0,prev,c,f,v;
      |                                ^
clo.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
clo.cpp:19:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     for(i=1;i<=n;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].v*=-1;
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
clo.cpp:21:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     for(i=n+1;i<=n+m;i++)scanf("%d %d %d",&a[i].c,&a[i].f,&a[i].v),a[i].c*=-1;
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 1 ms 1836 KB Output is correct
3 Correct 19 ms 1868 KB Output is correct
4 Correct 38 ms 1920 KB Output is correct
5 Correct 358 ms 1896 KB Output is correct
6 Correct 299 ms 1904 KB Output is correct
7 Correct 342 ms 1916 KB Output is correct
8 Correct 315 ms 1904 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 3 ms 1868 KB Output is correct
3 Correct 18 ms 1828 KB Output is correct
4 Correct 19 ms 1848 KB Output is correct
5 Correct 148 ms 1964 KB Output is correct
6 Correct 146 ms 1868 KB Output is correct
7 Correct 348 ms 1912 KB Output is correct
8 Correct 336 ms 1992 KB Output is correct
9 Correct 315 ms 1876 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1868 KB Output is correct
2 Correct 6 ms 1868 KB Output is correct
3 Correct 32 ms 1740 KB Output is correct
4 Correct 29 ms 1740 KB Output is correct
5 Correct 66 ms 1852 KB Output is correct
6 Correct 60 ms 1868 KB Output is correct
7 Correct 80 ms 1840 KB Output is correct
8 Correct 78 ms 1868 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1868 KB Output is correct
2 Correct 4 ms 1868 KB Output is correct
3 Correct 256 ms 1872 KB Output is correct
4 Correct 285 ms 1876 KB Output is correct
5 Correct 597 ms 1940 KB Output is correct
6 Correct 629 ms 1928 KB Output is correct
7 Correct 641 ms 1932 KB Output is correct
8 Correct 664 ms 1928 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 25 ms 1864 KB Output is correct
3 Correct 131 ms 1868 KB Output is correct
4 Correct 382 ms 1884 KB Output is correct
5 Correct 622 ms 1944 KB Output is correct
6 Correct 641 ms 1908 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 1 ms 1836 KB Output is correct
3 Correct 19 ms 1868 KB Output is correct
4 Correct 38 ms 1920 KB Output is correct
5 Correct 358 ms 1896 KB Output is correct
6 Correct 299 ms 1904 KB Output is correct
7 Correct 342 ms 1916 KB Output is correct
8 Correct 315 ms 1904 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 18 ms 1828 KB Output is correct
12 Correct 19 ms 1848 KB Output is correct
13 Correct 148 ms 1964 KB Output is correct
14 Correct 146 ms 1868 KB Output is correct
15 Correct 348 ms 1912 KB Output is correct
16 Correct 336 ms 1992 KB Output is correct
17 Correct 315 ms 1876 KB Output is correct
18 Correct 6 ms 1868 KB Output is correct
19 Correct 6 ms 1868 KB Output is correct
20 Correct 32 ms 1740 KB Output is correct
21 Correct 29 ms 1740 KB Output is correct
22 Correct 66 ms 1852 KB Output is correct
23 Correct 60 ms 1868 KB Output is correct
24 Correct 80 ms 1840 KB Output is correct
25 Correct 78 ms 1868 KB Output is correct
26 Correct 4 ms 1868 KB Output is correct
27 Correct 4 ms 1868 KB Output is correct
28 Correct 256 ms 1872 KB Output is correct
29 Correct 285 ms 1876 KB Output is correct
30 Correct 597 ms 1940 KB Output is correct
31 Correct 629 ms 1928 KB Output is correct
32 Correct 641 ms 1932 KB Output is correct
33 Correct 664 ms 1928 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 25 ms 1864 KB Output is correct
36 Correct 131 ms 1868 KB Output is correct
37 Correct 382 ms 1884 KB Output is correct
38 Correct 622 ms 1944 KB Output is correct
39 Correct 641 ms 1908 KB Output is correct
40 Correct 169 ms 1876 KB Output is correct
41 Correct 315 ms 1888 KB Output is correct
42 Correct 477 ms 1916 KB Output is correct
43 Correct 691 ms 1952 KB Output is correct
44 Correct 653 ms 1996 KB Output is correct
45 Correct 643 ms 1976 KB Output is correct
46 Correct 316 ms 1884 KB Output is correct
47 Correct 484 ms 1920 KB Output is correct
48 Correct 466 ms 1920 KB Output is correct