Submission #1173048

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1173048	2025-03-24 17:22:53	SpyrosAliv	Catfish Farm (IOI22_fish)	C++20	3 / 100	47 ms	7240 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>
#define ll long long
using namespace std;
ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W) {
    ll tot = 0;
    bool sub1 = true;
    bool sub2 = true;
    ll s1 = 0, s2 = 0;
    for (int i = 0; i < m; i++) {
        if (X[i] % 2) sub1 = false;
        if (X[i] > 1) sub2 = false;
        tot += W[i];
        if (X[i] == 0) s1 += W[i];
        else s2 += W[i];
    }
    if (sub1) return tot;
    if (sub2) return max(s1, s2);
    return 0;
    /*
    vector<vector<int>> grid(n+1, vector<int>(n+1, 0));
    for (int i = 0; i < m; i++) {
        grid[Y[i]][X[i]] += W[i];
        tot += W[i];
    }
    vector<vector<vector<vector<int>>>> dp(n+1, vector<vector<vector<int>>>(9, vector<vector<int>>(9, vector<int>(9, 0))));
    vector<vector<vector<int>>> act(n+1, vector<vector<int>>(9, vector<int>(9, 0)));
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < n; j++) {
            grid[i][j] += grid[i-1][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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