Submission #1079191

#	Time	Username	Problem	Language	Result	Execution time	Memory
1079191		vjudge1	Catfish Farm (IOI22_fish)	C++17	3 / 100	86 ms	13904 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>

#define fore(i, l, r) for(int i=int(l); i<int(r); i++)

using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  long long ok=1,ok1=1;
    fore(i,0,M) {
        if(X[i] % 2)
            ok=0;
        if(X[i] > 1)
            ok1=0;
    }
    long long ans=0;
    if(ok)
        fore(i,0,M)
            ans+=W[i];
    else if(ok1) {
        long long sum1=0,sum2=0;
        fore(i,0,M) {
            if(X[i] == 0)
                sum1+=W[i];
            else
                sum2+=W[i];
        }
        ans = max(sum1,sum2);
    } else {
        long long dp[N+5];
        memset(dp,0,sizeof dp);
        long long grid[N+5];
        memset(grid,0,sizeof grid);
        fore(i,0,M)
            grid[X[i]] = W[i];
        fore(i,0,N) {
            dp[i] = grid[i];
            if(i > 1)
                dp[i] += dp[i-2];
            if(i)
                dp[i] = max(dp[i],dp[i-1]);
        }
        ans = dp[N-1];
    }
    return ans;
  return 0;
}

• Subtask 1: 3 / 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