Submission #470720

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
470720	2021-09-05 08:29:10	prvocislo	Cloud Computing (CEOI18_clo)	C++17	100 / 100	2693 ms	5832 KiB

clo

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;
struct vec { int c, f, v; };
bool cmp(const vec& a, const vec& b) { return a.f > b.f; }
const int maxc = 55;
const ll inf = 1e18;
void upd(ll& a, const ll& b) { a = max(a, b); }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vec> p(n);
  for (int i = 0; i < n; i++) cin >> p[i].c >> p[i].f >> p[i].v;
  sort(p.begin(), p.end(), cmp);
  int m;
  cin >> m;
  vector<vec> z(m);
  for (int i = 0; i < m; i++) cin >> z[i].c >> z[i].f >> z[i].v;
  sort(z.begin(), z.end(), cmp);
  vector<vector<vector<ll> > > dp(2, vector<vector<ll>>(m + 1, vector<ll>(maxc * 2, -inf)));
  // dp[dalsi pocitac & 1][dalsi zakaznik][pocet pocitacov navyse]
  dp[0][0][0] = 0;
  ll ans = -inf;
  for (int i = 0; i < n; i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10