Submission #925193

#	Time	Username	Problem	Language	Result	Execution time	Memory
925193		IS_Rushdi	Catfish Farm (IOI22_fish)	C++17	0 / 100	75 ms	8040 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;


long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    // long long pre[n+1][n+1]{};
    // for(int i = 0; i < m; i++) x[i]++,y[i]++;
    // for(int i = 0; i < m; i++) pre[x[i]][y[i]] += w[i];
    // for(int i = 1; i <= n; i++){
    //     for(int j = 1; j <= n; j++){
    //         pre[i][j] += pre[i][j-1];
    //     }
    // }
    
    long long ans = 0;
    long long ans2 = 0;
    int cost[n][2]{};
    for(int i = 0; i < m; i++){
        if(x[i] == 1){cost[y[i]][1] = w[i]; ans += w[i];}
        if(x[i] == 0){ans2 += w[i];cost[y[i]][0]=w[i];}
    }
    if(n == 2 || n == 1) return max(ans,ans2);
    ans2 = max(ans,ans2);
    
    for(int i = 1; i < n; i++){
        ans -= cost[i-1][1];
        ans += cost[i][0];

        ans2 = max(ans2,ans);
    }
    return ans2;
}

// int main(){
//     cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
// }

• 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