Submission #1189892

#TimeUsernameProblemLanguageResultExecution timeMemory
1189892AmrCatfish Farm (IOI22_fish)C++20
6 / 100
49 ms9800 KiB
#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];
    }

    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] + b[i];
    if(N==2) return max(prea[N], preb[N]);

    for(int i = 0; i <= N; i++)
    {
        mx = max(mx,prea[i]+preb[N]-preb[i]);
    }
    return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...