oj.uz

Submission #997387

# Submission time Handle Problem Language Result Execution time Memory
997387 2024-06-12T08:29:38 Z daffuwu Cloud Computing (CEOI18_clo) C++14
100 / 100
 431 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

long long n, m, dp[2][100069]; //{komp sekarang, order sekarang, core tersisa komp, needed core order}

struct machine
{
    long long c, f, v;
    bool operator<(const machine other) const
    {
        if (f == other.f) return c>other.c;
        return f<other.f;
    }
} a[4069];

int main() 
{
    long long i, j;
    scanf("%lld", &n);
    for (i=1; i<=n; i++)
    {
        scanf("%lld%lld%lld", &a[i].c, &a[i].f, &a[i].v);
        a[i].c *= -1;
        a[i].v *= -1;
    }
    scanf("%lld", &m);
    for (i=1; i<=m; i++)
    {
        scanf("%lld%lld%lld", &a[n+i].c, &a[n+i].f, &a[n+i].v);
    }
    sort(a+1, a+n+m+1);
    //dp[i][j] --> max uang kalau total core adalah j
    for (j=1; j<=100000; j++) dp[(n+m+1)%2][j] = -1e15; 
    for (i=n+m; i>=1; i--)
    {
        for (j=0; j<=100000; j++)
        {
            dp[i%2][j] = dp[(i+1)%2][j];
            if (j+a[i].c<=100000) dp[i%2][j] = max(dp[i%2][j], dp[(i+1)%2][max(0ll, j+a[i].c)]+a[i].v);
        }
    }
    printf("%lld\n", dp[1][0]);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%lld%lld%lld", &a[i].c, &a[i].f, &a[i].v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%lld", &m);
      |     ~~~~~^~~~~~~~~~~~
clo.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         scanf("%lld%lld%lld", &a[n+i].c, &a[n+i].f, &a[n+i].v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 11 ms 1884 KB Output is correct
4 Correct 21 ms 1884 KB Output is correct
5 Correct 195 ms 1884 KB Output is correct
6 Correct 192 ms 1884 KB Output is correct
7 Correct 200 ms 1884 KB Output is correct
8 Correct 216 ms 2032 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 11 ms 1884 KB Output is correct
4 Correct 11 ms 2004 KB Output is correct
5 Correct 95 ms 2008 KB Output is correct
6 Correct 91 ms 2000 KB Output is correct
7 Correct 217 ms 1884 KB Output is correct
8 Correct 203 ms 1880 KB Output is correct
9 Correct 194 ms 1880 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1884 KB Output is correct
2 Correct 4 ms 1884 KB Output is correct
3 Correct 23 ms 2016 KB Output is correct
4 Correct 18 ms 1884 KB Output is correct
5 Correct 36 ms 1884 KB Output is correct
6 Correct 41 ms 1880 KB Output is correct
7 Correct 50 ms 1884 KB Output is correct
8 Correct 50 ms 1884 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 155 ms 1972 KB Output is correct
4 Correct 186 ms 2040 KB Output is correct
5 Correct 377 ms 2136 KB Output is correct
6 Correct 407 ms 2132 KB Output is correct
7 Correct 431 ms 2140 KB Output is correct
8 Correct 428 ms 2140 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 17 ms 1880 KB Output is correct
3 Correct 81 ms 1880 KB Output is correct
4 Correct 199 ms 2028 KB Output is correct
5 Correct 422 ms 2076 KB Output is correct
6 Correct 395 ms 1884 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 11 ms 1884 KB Output is correct
4 Correct 21 ms 1884 KB Output is correct
5 Correct 195 ms 1884 KB Output is correct
6 Correct 192 ms 1884 KB Output is correct
7 Correct 200 ms 1884 KB Output is correct
8 Correct 216 ms 2032 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 11 ms 1884 KB Output is correct
12 Correct 11 ms 2004 KB Output is correct
13 Correct 95 ms 2008 KB Output is correct
14 Correct 91 ms 2000 KB Output is correct
15 Correct 217 ms 1884 KB Output is correct
16 Correct 203 ms 1880 KB Output is correct
17 Correct 194 ms 1880 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 23 ms 2016 KB Output is correct
21 Correct 18 ms 1884 KB Output is correct
22 Correct 36 ms 1884 KB Output is correct
23 Correct 41 ms 1880 KB Output is correct
24 Correct 50 ms 1884 KB Output is correct
25 Correct 50 ms 1884 KB Output is correct
26 Correct 2 ms 1880 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 155 ms 1972 KB Output is correct
29 Correct 186 ms 2040 KB Output is correct
30 Correct 377 ms 2136 KB Output is correct
31 Correct 407 ms 2132 KB Output is correct
32 Correct 431 ms 2140 KB Output is correct
33 Correct 428 ms 2140 KB Output is correct
34 Correct 2 ms 1880 KB Output is correct
35 Correct 17 ms 1880 KB Output is correct
36 Correct 81 ms 1880 KB Output is correct
37 Correct 199 ms 2028 KB Output is correct
38 Correct 422 ms 2076 KB Output is correct
39 Correct 395 ms 1884 KB Output is correct
40 Correct 107 ms 1880 KB Output is correct
41 Correct 191 ms 1880 KB Output is correct
42 Correct 307 ms 1880 KB Output is correct
43 Correct 414 ms 2136 KB Output is correct
44 Correct 416 ms 2136 KB Output is correct
45 Correct 397 ms 2136 KB Output is correct
46 Correct 199 ms 1884 KB Output is correct
47 Correct 304 ms 2096 KB Output is correct
48 Correct 309 ms 2092 KB Output is correct