Submission #626238

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
626238	2022-08-11 10:18:34	Temmie	Catfish Farm (IOI22_fish)	C++17	100 / 100	275 ms	52400 KiB

fish

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 <bits/stdc++.h>
long long max_weights(int n, int m, std::vector <int> _x, std::vector <int> _y, std::vector <int> _w) {
  std::vector <std::vector <std::pair <int, int>>> of(n);
  for (int i = 0; i < m; i++) {
    of[_x[i]].emplace_back(_y[i], _w[i]);
  }
  for (int i = 0; i < n; i++) {
    of[i].emplace_back(0, 0);
    of[i].emplace_back(n, 0);
    std::sort(of[i].begin(), of[i].end());
    if (!of[i][1].first) {
      of[i].erase(of[i].begin());
    }
  }
  std::vector <std::vector <std::vector <long long>>> dp(n, std::vector <std::vector <long long>> (3));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 3; j++) {
      dp[i][j].resize(of[i].size());
    }
  }
  std::vector <std::vector <long long>> pre(n);
  for (int i = 0; i < n; i++) {
    pre[i].resize(of[i].size());
    pre[i][0] = of[i][0].second;
    for (int j = 1; j < (int) of[i].size(); j++) {
      pre[i][j] = pre[i][j - 1] + of[i][j].second;
    }
  }
  dp[0][0].assign(dp[0][0].size(), 0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 17 / 17
• Subtask 7: 14 / 14
• Subtask 8: 16 / 16