oj.uz

Submission #711214

# Submission time Handle Problem Language Result Execution time Memory
711214 2023-03-16T10:18:38 Z lolik123 Cloud Computing (CEOI18_clo) C++14
100 / 100
 492 ms 2064 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define f first
#define sortshit second.first
#define c second.second.first
#define v second.second.second

constexpr ll inf = 1e18;

int n,m,rdz,tc,tf,tv;
vector<pair <int, pair<int,pair<int,int>>>> arr;
vector <ll> dp,temp;
ll res;

void em(int it, int af, int at, int ac, int av)
{
	arr[it].f = af;
  arr[it].sortshit = at;
  arr[it].c = ac;
  arr[it].v = av;
}

void preprocess()
{
	cin.tie(0) -> ios_base::sync_with_stdio(0);

	cin >> n;
	arr.resize(n);

	for(int i=0; i<n; i++)
  {
    cin >> tc >> tf >> tv;
    em(i, -tf, 69, tc, -tv);
    rdz += tc;
  }

  cin >> m;
  arr.resize(n+m);

  for(int i=0; i<m; i++)
  {
    cin >> tc >> tf >> tv;
    em(i+n, -tf, 420, -tc, tv);
  }
}

void solve()
{
	sort(arr.begin(), arr.end());

	dp.resize(rdz+69);
	temp.resize(rdz+69);

	for(int i=1; i<dp.size(); i++)
		dp[i] = -inf;

  for(auto a : arr)
  {
    temp = dp;
    for(int j=max(0,a.c); j<=rdz; j++)
      temp[j] = max(temp[j], dp[j - a.c] + a.v);

    swap(dp, temp);
  }

  for(auto x : dp)
  	res = max(x,res);

  cout << res;
}

int main()
{
  preprocess();
  solve();
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:56:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for(int i=1; i<dp.size(); i++)
      |               ~^~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 3 ms 400 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 27 ms 724 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 122 ms 1236 KB Output is correct
8 Correct 22 ms 468 KB Output is correct
9 Correct 199 ms 1760 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 8 ms 308 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 205 ms 1172 KB Output is correct
6 Correct 392 ms 1876 KB Output is correct
7 Correct 440 ms 1880 KB Output is correct
8 Correct 492 ms 1816 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 27 ms 724 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 397 ms 1876 KB Output is correct
6 Correct 401 ms 1852 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 3 ms 400 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 27 ms 724 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 122 ms 1236 KB Output is correct
16 Correct 22 ms 468 KB Output is correct
17 Correct 199 ms 1760 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 320 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 8 ms 308 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 205 ms 1172 KB Output is correct
31 Correct 392 ms 1876 KB Output is correct
32 Correct 440 ms 1880 KB Output is correct
33 Correct 492 ms 1816 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 27 ms 724 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 397 ms 1876 KB Output is correct
39 Correct 401 ms 1852 KB Output is correct
40 Correct 26 ms 724 KB Output is correct
41 Correct 71 ms 852 KB Output is correct
42 Correct 6 ms 340 KB Output is correct
43 Correct 448 ms 2032 KB Output is correct
44 Correct 491 ms 2032 KB Output is correct
45 Correct 469 ms 2064 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 7 ms 332 KB Output is correct
48 Correct 9 ms 448 KB Output is correct