Submission #832438

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
832438	2023-08-21 10:21:04	rnl42	Catfish Farm (IOI22_fish)	C++17	0 / 100	1064 ms	2097152 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 <vector>
#include <algorithm>
#include <iostream>
using namespace std;
#define int long long
using piii = pair<int,pair<int,int>>;
#ifdef DEBUG
#define dbg(x) cerr << "(" #x ") = " << x << '\n'
#define dbgln() cerr << '\n'
#else
#define dbg(x) void(0)
#define dbgln(x) void(0)
#endif
int max_weights(signed N, signed M, vector<signed> X, vector<signed> Y, vector<signed> W) {
    vector<vector<int>> grid(N, vector<int>(N+2));
    vector<vector<int>> cumulsum(N, vector<int>(N+2));
    for (int i = 0; i < M; i++) grid[X[i]][Y[i]] = W[i];
    for (int x = 0; x < N; x++) {
        for (int y = 0; y <= N; y++) {
            cumulsum[x][y+1] = cumulsum[x][y]+grid[x][y];
        }
    }
    vector<vector<int>> best_asc(N, vector<int>(N+2)), best_desc(N, vector<int>(N+2));
    for (int y = 0; y <= N+1; y++) {
        best_asc[0][y] = cumulsum[0][y+1];
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 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