Submission #642054

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
642054	2022-09-18 11:09:58	dykw	Catfish Farm (IOI22_fish)	C++17	100 / 100	139 ms	20420 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 "fish.h"
#include <bits/stdc++.h>
using i64 = long long;
i64 max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  std::vector<std::vector<int>> pos(N);
    for (int i = 0; i < M; ++i) {
        pos[X[i]].push_back(i);
    }
    for (int i = 0; i < N; ++i) {
        std::sort(pos[i].begin(), pos[i].end(), [&](int lhs, int rhs) {
            return Y[lhs] < Y[rhs];
        });
    }
    auto chmax = [](i64 &x, i64 y) {
        x = std::max(x, y);
    };
    i64 ans = 0;
    std::vector<i64> f(M), g(M), max_f(N), max_g(N);
    for (int i = 0; i < N; ++i) {
        if (i > 0) {
            max_f[i] = max_g[i] = std::max(max_f[i - 1], max_g[i - 1]);
        }
        int len = pos[i].size(), len_1 = i > 0 ? pos[i - 1].size() : 0, p = 0;
        i64 val;
        if (i < N - 1) {
            val = i > 0 ? max_g[i - 1] : 0;
            if (i > 1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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