oj.uz

Submission #479932

# Submission time Handle Problem Language Result Execution time Memory
479932 2021-10-14T01:19:46 Z tphuc2908 Cloud Computing (CEOI18_clo) C++14
100 / 100
 2173 ms 2116 KB 
#include<bits/stdc++.h>

using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define repi(i,x,y) for(int i = x; i >= y; --i)
#define ci(x) int x; cin>> x
#define TC(t) ci(t); while(t--)
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define cii(x, y) ci(x); ci(y)
#define ciii(x, y, z) ci(x); ci(y); ci(z)
#define mp make_pair
#define int long long
typedef long long ll;
typedef vector<int> vi;
const int N = 40 + 5;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 9;
const int pi = 31, pii = 29, piii = 41;
const int inf = 1e15 + 5;
const int block = 330;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};

void readfile(){
    #ifdef ONLINE_JUDGE
    #else
        freopen("text.inp", "r", stdin);
    #endif // ONLINE_JUDGE
//    freopen("mooriokart.in", "r", stdin);
//    freopen("mooriokart.out", "w", stdout);
}

int n, m;
struct info{
    int c, f, v;
} a[4005];

void inp(){
    cin >> n;
    rep(i,1,n){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].v *= -1;
    }
    cin >> m;
    rep(i,n+1,n+m){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].c *= -1;
    }
    sort(a + 1, a + n + m + 1, [](const info &x, const info &y){return x.f > y.f || (x.f == y.f && x.v < y.v);});
}

vector<ll> dp_before, dp_after;

void process(){
    dp_before.resize(100005, -inf);
    dp_after = dp_before;
    dp_before[0] = 0;
    rep(i,1,n+m){
        rep(j,0,100000){
            dp_after[j] = max(dp_after[j], dp_before[j]);
            if(j + a[i].c >= 0 && j + a[i].c <= 100000)
                dp_after[j + a[i].c] = max(dp_after[j + a[i].c], dp_before[j] + a[i].v);
        }
        dp_before = dp_after;
        dp_after.assign(100005, -inf);
    }
    cout << *max_element(all(dp_before));
}

 main() {
   // readfile();
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    TC(t){
        inp();
        process();
//    }
    return 0;
}

Compilation message

clo.cpp:76:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   76 |  main() {
      |  ^~~~
clo.cpp: In function 'void readfile()':
clo.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen("text.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
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 62 ms 1888 KB Output is correct
4 Correct 109 ms 1868 KB Output is correct
5 Correct 1002 ms 1936 KB Output is correct
6 Correct 1012 ms 1932 KB Output is correct
7 Correct 1057 ms 1940 KB Output is correct
8 Correct 1051 ms 1868 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1868 KB Output is correct
2 Correct 7 ms 1868 KB Output is correct
3 Correct 59 ms 1868 KB Output is correct
4 Correct 60 ms 1884 KB Output is correct
5 Correct 483 ms 1916 KB Output is correct
6 Correct 524 ms 1868 KB Output is correct
7 Correct 1082 ms 1936 KB Output is correct
8 Correct 1113 ms 1940 KB Output is correct
9 Correct 1051 ms 1924 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1900 KB Output is correct
2 Correct 18 ms 1896 KB Output is correct
3 Correct 99 ms 1804 KB Output is correct
4 Correct 101 ms 1868 KB Output is correct
5 Correct 205 ms 1988 KB Output is correct
6 Correct 211 ms 1996 KB Output is correct
7 Correct 283 ms 1904 KB Output is correct
8 Correct 276 ms 1868 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1868 KB Output is correct
2 Correct 10 ms 1900 KB Output is correct
3 Correct 827 ms 1916 KB Output is correct
4 Correct 962 ms 1936 KB Output is correct
5 Correct 1984 ms 2032 KB Output is correct
6 Correct 2148 ms 2116 KB Output is correct
7 Correct 2089 ms 2016 KB Output is correct
8 Correct 2092 ms 2016 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1868 KB Output is correct
2 Correct 88 ms 1880 KB Output is correct
3 Correct 442 ms 1908 KB Output is correct
4 Correct 1077 ms 1928 KB Output is correct
5 Correct 2101 ms 1968 KB Output is correct
6 Correct 2064 ms 1988 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 3 ms 1868 KB Output is correct
3 Correct 62 ms 1888 KB Output is correct
4 Correct 109 ms 1868 KB Output is correct
5 Correct 1002 ms 1936 KB Output is correct
6 Correct 1012 ms 1932 KB Output is correct
7 Correct 1057 ms 1940 KB Output is correct
8 Correct 1051 ms 1868 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 7 ms 1868 KB Output is correct
11 Correct 59 ms 1868 KB Output is correct
12 Correct 60 ms 1884 KB Output is correct
13 Correct 483 ms 1916 KB Output is correct
14 Correct 524 ms 1868 KB Output is correct
15 Correct 1082 ms 1936 KB Output is correct
16 Correct 1113 ms 1940 KB Output is correct
17 Correct 1051 ms 1924 KB Output is correct
18 Correct 17 ms 1900 KB Output is correct
19 Correct 18 ms 1896 KB Output is correct
20 Correct 99 ms 1804 KB Output is correct
21 Correct 101 ms 1868 KB Output is correct
22 Correct 205 ms 1988 KB Output is correct
23 Correct 211 ms 1996 KB Output is correct
24 Correct 283 ms 1904 KB Output is correct
25 Correct 276 ms 1868 KB Output is correct
26 Correct 10 ms 1868 KB Output is correct
27 Correct 10 ms 1900 KB Output is correct
28 Correct 827 ms 1916 KB Output is correct
29 Correct 962 ms 1936 KB Output is correct
30 Correct 1984 ms 2032 KB Output is correct
31 Correct 2148 ms 2116 KB Output is correct
32 Correct 2089 ms 2016 KB Output is correct
33 Correct 2092 ms 2016 KB Output is correct
34 Correct 4 ms 1868 KB Output is correct
35 Correct 88 ms 1880 KB Output is correct
36 Correct 442 ms 1908 KB Output is correct
37 Correct 1077 ms 1928 KB Output is correct
38 Correct 2101 ms 1968 KB Output is correct
39 Correct 2064 ms 1988 KB Output is correct
40 Correct 562 ms 1924 KB Output is correct
41 Correct 1028 ms 1952 KB Output is correct
42 Correct 1764 ms 2012 KB Output is correct
43 Correct 2173 ms 2024 KB Output is correct
44 Correct 2150 ms 2028 KB Output is correct
45 Correct 2070 ms 2064 KB Output is correct
46 Correct 1108 ms 1968 KB Output is correct
47 Correct 1711 ms 1996 KB Output is correct
48 Correct 1653 ms 1996 KB Output is correct