제출 #660738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660738		mychecksedad	메기 농장 (IOI22_fish)	C++17	3 / 100	91 ms	13924 KiB

fish

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
const int S = 1e5;


ll dp[S][2];
long long max_weights(int N, int M, std::vector<int> x, std::vector<int> y,
                      std::vector<int> w){  
    bool case1 = 1, case2 = 1, case3 = 1;
    for(int i = 0; i < M; ++i){
        if(x[i] % 2) case1 = 0;
        if(x[i] > 1) case2 = 0;
        if(y[i] != 0) case3 = 0;
    }
    if(case1){
        ll ans = 0;
        for(int i = 0; i < M; ++i) ans += w[i];
        return ans;
    }
    if(case2){
        ll ans1 = 0, ans2 = 0;

        vector<int> a;
        vector<int> b;

        for(int i = 0; i < M; ++i) if(x[i] == 0) ans1 += w[i]; else ans2 += w[i];


        return max(ans1, ans2);
    }
    if(case3){
        for(int i = 0; i <= N; ++i){
            dp[i][0] = dp[i][1] = 0;
        }
        vector<int> v(N+5); for(int i = 0; i < M; ++i) v[x[i]] = w[i];
        for(int i = 1; i <= N; ++i){
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
            if(i>2){
                dp[i][1] += v[i + 1];
                dp[i][1] += max(dp[i - 2][0] + v[i - 1], dp[i - 2][1]);
            }else{
                dp[i][1] += v[i - 1];
                dp[i][1] += v[i + 1];
            }
        }
        return max(dp[N][0], dp[N][1]);
    }
    return -1;
}   

• 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