Submission #950848

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
950848	2024-03-20 19:36:32	Dec0Dedd	Catfish Farm (IOI22_fish)	C++17	0 / 100	1047 ms	57588 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>
#include "fish.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 310;
ll n, m, x[N], y[N], w[N], dp[N][N][N], cnt[N][N], p[N][N];
ll max_weights(int _n, int _m, vector<int> _x, vector<int> _y, vector<int> _w) {
    n=_n, m=_m;
    for (int i=1; i<=m; ++i) {
        x[i]=_x[i-1], y[i]=_y[i-1], w[i]=_w[i-1];
        ++x[i], ++y[i];
        cnt[x[i]][y[i]]+=w[i];
    }
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) p[i][j]=p[i][j-1]+cnt[i][j];
    }
    for (int i=2; i<=n; ++i) {
        for (int j=0; j<=n; ++j) {
            for (int k=0; k<=n; ++k) {
                if (k == 0) {
                    int mx=n;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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