제출 #994182

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
994182	2024-06-07 08:22:47	cpdreamer	메기 농장 (IOI22_fish)	C++17	35 / 100	959 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 <bits/stdc++.h>
using namespace std;
typedef long long  ll;
#define V vector
#define pb push_back
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    vector<vector<long long >>grid(N+1,vector<long long>(N+1,0));
    for(int i=0;i<M;i++){
        grid[X[i]][Y[i]+1]+=W[i];
    }
    for(int i=0;i<N;i++){
        for(int j=1;j<=N;j++){
            grid[i][j]+=grid[i][j-1];
        }
    }
    V<V<V<ll>>>dp(N,V<V<ll>>(N+1,V<ll>(N+1,0)));
    V<V<V<ll>>>vp(N,V<V<ll>>(N+1,V<ll>(N+1,0)));
    for(int i=0;i<=N;i++){
        for(int j=0;j<=N;j++){
            dp[0][i][j]=max(0LL,grid[0][j]-grid[0][i]);
            vp[0][i][j]=dp[0][i][j]+max(0LL,grid[1][i]-grid[1][j]);
        }
    }
    for(int i=1;i<N;i++){
        for(int j=0;j<=N;j++){
            V<ll>a;
            for(int g=0;g<=N;g++)
                a.pb(dp[i-1][g][j]);
            for(int g=1;g<=N;g++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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