Submission #1189886

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189886		Amr	Catfish Farm (IOI22_fish)	C++20	0 / 100	48 ms	9800 KiB

fish

#include "fish.h"
#include <vector>

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz size()
const int N2 = 1e5+2;
 ll a[N2]={0}, b[N2], prea[N2], preb[N2];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {


    prea[0] = preb[0] = 0;
    for(int i = 0; i < M; i++)
    {
        ll x = X[i] ,y = Y[i];
        if(x==0) a[y+1] = W[i];
        else b[y+1] = W[i];
    }
    if(M==2) return max(prea[N], preb[N]);

    ll mx = 0;

    for(int i = 1; i <= N; i++) prea[i] = prea[i-1] + a[i];
    for(int i = 1; i <= N; i++) preb[i] = preb[i-1] + a[i];
    for(int i = 0; i <= N; i++)
    {
        mx = max(mx,prea[i]+preb[N]-preb[i]);
    }
    return mx;
}

• 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