Submission #812489

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
812489	2023-08-07 08:56:38	_martynas	Catfish Farm (IOI22_fish)	C++17	100 / 100	795 ms	93652 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 namespace std;
#define pb push_back
using ll = long long;
using pii = pair<int, int>;
const ll inf = 1e16;
int n, m;
map<pii, ll> F;
// ll max_weights_y0(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
//     n = N, m = M;
//     vector<ll> A(n);
//     for(int i = 0; i < m; i++) A[X[i]] = W[i];
//     auto get = [&](int i) {
//         return (i < 0 || i >= n ? 0 : A[i]);
//     };
//     ll mx1 = 0, mx2 = 0, mx3 = 0;
//     for(int i = 0; i < n; i++) {
//         ll nmx1, nmx2, nmx3;
//         nmx3 = max(mx3, mx2);
//         nmx2 = max(mx2, mx1);
//         nmx1 = max(mx1, mx3+get(i-1)+get(i+1));
//         nmx1 = max(nmx1, mx2+get(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