oj.uz

Submission #484188

# Submission time Handle Problem Language Result Execution time Memory
484188 2021-11-02T10:38:17 Z Killer2501 Cloud Computing (CEOI18_clo) C++14
100 / 100
 298 ms 1604 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
using namespace std;
const int N = 4e3+15;
const int M = 550;
const ll mod = 998244353;
const ld base = 1e6;
const ll inf = 1e16;
const ld pi = acos(-1);
ll n, m, k, ans,  cnt[N], t, dp[N*50], c[N], tong, lab[N], a[N], b[N];
vector<ll> adj[N];
string s[N];
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
vector<ll> kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n&1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
ll findp(ll u)
{
    return lab[u] < 0 ? u : lab[u] = findp(lab[u]);
}
void hop(ll u, ll v)
{
    if(lab[u] > lab[v])swap(u, v);
    lab[u] += lab[v];
    lab[v] = u;
    k = max(k, -lab[u]);
}
struct BIT
{
    ll n;
    vector<ll> fe;
    BIT(ll _n)
    {
        n = _n;
        fe.resize(n+1, 0);
    }
    void add(ll id, ll x)
    {
        for(; id <= n; id += id & -id)fe[id] = max(fe[id], x);
    }
    ll get(ll id)
    {
        ll total = 0;
        for(; id; id -= id & -id)total = max(total, fe[id]);
        return total;
    }
};
struct node
{
    ll f, c, v, ok;
    bool operator < (const node& x)
    {
        return (f > x.f) || (f == x.f && ok > x.ok);
    }
}st[N*2];
void sol()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        cin >> st[i].c >> st[i].f >> st[i].v;
        st[i].ok = 1;
    }
    cin >> m;
    for(int i = 1; i <= m; i ++)
    {
        cin >> st[i+n].c >> st[i+n].f >> st[i+n].v;
        st[i+n].ok = 0;
    }
    sort(st+1, st+1+m+n);
    fill_n(dp, n*50+1, -inf);
    dp[0] = 0;
    for(int i = 1; i <= n+m; i ++)
    {
        //cout << st[i].ok <<" "<<st[i].c<<" "<<st[i].f <<" "<<st[i].v << '\n';
        if(st[i].ok)
        {
            k += st[i].c;
            for(int j = k; j > 0; j --)if(dp[max(0ll, j-st[i].c)] != -inf)dp[j] = max(dp[j], dp[max(0ll, j-st[i].c)]-st[i].v);
        }
        else
        {
            for(int j = 0; j <= k-st[i].c; j ++)if(dp[j+st[i].c] != -inf)dp[j] = max(dp[j], dp[j+st[i].c]+st[i].v);
        }
        //for(int j = 0; j <= k; j ++)cout << dp[j] <<" ";
        //cout << '\n';
    }
    for(int i = 0; i <= k; i ++)ans = max(ans, dp[i]);
    cout << ans;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    #define task "tests"
    if(fopen(task".inp", "r"))
	{
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}
    int test = 1;
    //cin >> test;
    while(test -- > 0)sol();
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:114:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:115:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 460 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 12 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 56 ms 1420 KB Output is correct
8 Correct 8 ms 1356 KB Output is correct
9 Correct 89 ms 1356 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 460 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 0 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 688 KB Output is correct
8 Correct 1 ms 588 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 5 ms 1100 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 144 ms 1484 KB Output is correct
6 Correct 277 ms 1484 KB Output is correct
7 Correct 268 ms 1492 KB Output is correct
8 Correct 255 ms 1448 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 11 ms 800 KB Output is correct
4 Correct 4 ms 884 KB Output is correct
5 Correct 174 ms 1484 KB Output is correct
6 Correct 262 ms 1464 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 12 ms 844 KB Output is correct
14 Correct 2 ms 844 KB Output is correct
15 Correct 56 ms 1420 KB Output is correct
16 Correct 8 ms 1356 KB Output is correct
17 Correct 89 ms 1356 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 588 KB Output is correct
21 Correct 0 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 552 KB Output is correct
24 Correct 1 ms 688 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 0 ms 460 KB Output is correct
28 Correct 5 ms 1100 KB Output is correct
29 Correct 2 ms 588 KB Output is correct
30 Correct 144 ms 1484 KB Output is correct
31 Correct 277 ms 1484 KB Output is correct
32 Correct 268 ms 1492 KB Output is correct
33 Correct 255 ms 1448 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 11 ms 800 KB Output is correct
37 Correct 4 ms 884 KB Output is correct
38 Correct 174 ms 1484 KB Output is correct
39 Correct 262 ms 1464 KB Output is correct
40 Correct 13 ms 792 KB Output is correct
41 Correct 34 ms 908 KB Output is correct
42 Correct 4 ms 1228 KB Output is correct
43 Correct 294 ms 1492 KB Output is correct
44 Correct 298 ms 1604 KB Output is correct
45 Correct 193 ms 1528 KB Output is correct
46 Correct 2 ms 984 KB Output is correct
47 Correct 4 ms 1272 KB Output is correct
48 Correct 4 ms 1236 KB Output is correct