oj.uz

Submission #71045

# Submission time Handle Problem Language Result Execution time Memory
71045 2018-08-24T04:43:50 Z qkxwsm Cloud Computing (CEOI18_clo) C++17
100 / 100
 499 ms 1664 KB 
/*
PROG: source
LANG: C++11
_____
.'     '.
/  0   0  \
|     ^     |
|  \     /  |
\  '---'  /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
        T input = 0;
        bool negative = false;
        char c = ' ';
        while (c < '-')
        {
                c = getchar();
        }
        if (c == '-')
        {
                negative = true;
                c = getchar();
        }
        while (c >= '0')
        {
                input = input * 10 + (c - '0');
                c = getchar();
        }
        if (negative)
        {
                input = -input;
        }
        x = input;
}
template<class T>
void printi(T output)
{
        if (output == 0)
        {
                putchar('0');
                return;
        }
        if (output < 0)
        {
                putchar('-');
                output = -output;
        }
        int aout[20];
        int ilen = 0;
        while(output)
        {
                aout[ilen] = ((output % 10));
                output /= 10;
                ilen++;
        }
        for (int i = ilen - 1; i >= 0; i--)
        {
                putchar(aout[i] + '0');
        }
        return;
}
template<class T>
void ckmin(T &a, T b)
{
        a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
        a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
        return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
        return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
        return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 2013
#define MAXM 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, M;
pair<ll, pll> tmp[MAXN];
vector<pll> news[MAXN];
pll arr[MAXN];
ll dp[MAXM];
ll ans;

int32_t main()
{
        ios_base::sync_with_stdio(0);
        srand(time(0));
        //	cout << fixed << setprecision(10);
        //	cerr << fixed << setprecision(10);
        if (fopen("input.in", "r"))
        {
                freopen ("input.in", "r", stdin);
                freopen ("output.out", "w", stdout);
        }
        cin >> N;
        for (int i = 0; i < N; i++)
        {
                ll c, f, v;
                cin >> c >> f >> v;
                tmp[i] = {f, {c, v}};
        }
        sort(tmp, tmp + N);
        cin >> M;
        for (int i = 0; i < M; i++)
        {
                ll c, f, v;
                cin >> c >> f >> v;
                int cap;
                for (cap = 0; cap <= N; cap++)
                {
                        if (cap == N || tmp[cap].fi >= f)
                        {
                                break;
                        }
                }
                news[cap].PB({c, v});
                // cerr << "at time " << cap << " offer " << c << " cores " << v << " gain" << endl;
        }
        for (int i = 0; i < N; i++)
        {
                arr[i] = tmp[i].se;
                // cerr << arr[i].fi << ',' << arr[i].se << endl;
        }
        //(cores, price)
        for (int i = 0; i < MAXM; i++)
        {
                dp[i] = -LLINF;
        }
        dp[0] = 0;
        for (int i = N - 1; i >= 0; i--)
        {
                for (int j = MAXM - arr[i].fi - 1; j >= 0; j--)
                {
                        ckmax(dp[j + arr[i].fi], dp[j] - arr[i].se);
                }
                for (pll x : news[i])
                {
                        for (int j = x.fi; j < MAXM; j++)
                        {
                                //say you're going to buy x
                                ckmax(dp[j - x.fi], dp[j] + x.se);
                        }
                }
        }
        for (int i = 0; i < MAXM; i++)
        {
                ckmax(ans, dp[i]);
        }
        cout << ans << '\n';
        //people start becoming available
        //the guy you're okay with going up to increases
        //	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
        return 0;
}

Compilation message

clo.cpp: In function 'int32_t main()':
clo.cpp:159:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("input.in", "r", stdin);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:160:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("output.out", "w", stdout);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 22 ms 1192 KB Output is correct
4 Correct 29 ms 1348 KB Output is correct
5 Correct 194 ms 1352 KB Output is correct
6 Correct 218 ms 1424 KB Output is correct
7 Correct 189 ms 1424 KB Output is correct
8 Correct 200 ms 1424 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1424 KB Output is correct
2 Correct 5 ms 1424 KB Output is correct
3 Correct 17 ms 1424 KB Output is correct
4 Correct 18 ms 1424 KB Output is correct
5 Correct 101 ms 1484 KB Output is correct
6 Correct 170 ms 1484 KB Output is correct
7 Correct 241 ms 1520 KB Output is correct
8 Correct 211 ms 1520 KB Output is correct
9 Correct 212 ms 1520 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1520 KB Output is correct
2 Correct 6 ms 1520 KB Output is correct
3 Correct 15 ms 1520 KB Output is correct
4 Correct 13 ms 1520 KB Output is correct
5 Correct 37 ms 1520 KB Output is correct
6 Correct 54 ms 1520 KB Output is correct
7 Correct 56 ms 1536 KB Output is correct
8 Correct 56 ms 1536 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 6 ms 1536 KB Output is correct
3 Correct 207 ms 1544 KB Output is correct
4 Correct 186 ms 1544 KB Output is correct
5 Correct 419 ms 1624 KB Output is correct
6 Correct 421 ms 1660 KB Output is correct
7 Correct 428 ms 1660 KB Output is correct
8 Correct 393 ms 1660 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1660 KB Output is correct
2 Correct 10 ms 1660 KB Output is correct
3 Correct 105 ms 1660 KB Output is correct
4 Correct 250 ms 1660 KB Output is correct
5 Correct 438 ms 1660 KB Output is correct
6 Correct 433 ms 1664 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 22 ms 1192 KB Output is correct
4 Correct 29 ms 1348 KB Output is correct
5 Correct 194 ms 1352 KB Output is correct
6 Correct 218 ms 1424 KB Output is correct
7 Correct 189 ms 1424 KB Output is correct
8 Correct 200 ms 1424 KB Output is correct
9 Correct 4 ms 1424 KB Output is correct
10 Correct 5 ms 1424 KB Output is correct
11 Correct 17 ms 1424 KB Output is correct
12 Correct 18 ms 1424 KB Output is correct
13 Correct 101 ms 1484 KB Output is correct
14 Correct 170 ms 1484 KB Output is correct
15 Correct 241 ms 1520 KB Output is correct
16 Correct 211 ms 1520 KB Output is correct
17 Correct 212 ms 1520 KB Output is correct
18 Correct 6 ms 1520 KB Output is correct
19 Correct 6 ms 1520 KB Output is correct
20 Correct 15 ms 1520 KB Output is correct
21 Correct 13 ms 1520 KB Output is correct
22 Correct 37 ms 1520 KB Output is correct
23 Correct 54 ms 1520 KB Output is correct
24 Correct 56 ms 1536 KB Output is correct
25 Correct 56 ms 1536 KB Output is correct
26 Correct 5 ms 1536 KB Output is correct
27 Correct 6 ms 1536 KB Output is correct
28 Correct 207 ms 1544 KB Output is correct
29 Correct 186 ms 1544 KB Output is correct
30 Correct 419 ms 1624 KB Output is correct
31 Correct 421 ms 1660 KB Output is correct
32 Correct 428 ms 1660 KB Output is correct
33 Correct 393 ms 1660 KB Output is correct
34 Correct 5 ms 1660 KB Output is correct
35 Correct 10 ms 1660 KB Output is correct
36 Correct 105 ms 1660 KB Output is correct
37 Correct 250 ms 1660 KB Output is correct
38 Correct 438 ms 1660 KB Output is correct
39 Correct 433 ms 1664 KB Output is correct
40 Correct 143 ms 1664 KB Output is correct
41 Correct 228 ms 1664 KB Output is correct
42 Correct 336 ms 1664 KB Output is correct
43 Correct 482 ms 1664 KB Output is correct
44 Correct 444 ms 1664 KB Output is correct
45 Correct 499 ms 1664 KB Output is correct
46 Correct 266 ms 1664 KB Output is correct
47 Correct 360 ms 1664 KB Output is correct
48 Correct 350 ms 1664 KB Output is correct