제출 #925284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925284		IS_Rushdi	Catfish Farm (IOI22_fish)	C++17	67 / 100	1016 ms	32592 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){
    int mx = *max_element(y.begin(),y.end());
    if(n <= 300){
        long long dp[n+2][n+2][2]{};
    long long sum[n+2][n+2]{};
    for(int i = 0; i < m; i++) x[i] += 1;
    for(int i = 0; i < m; i++) y[i] += 1;
    for(int i = 0; i < m; i++) sum[x[i]][y[i]] += w[i];
    long long ans = 0;
    for(int i = 0; i <= n+1; i++){
        for(int j = n; j >= 0; j--){
            sum[i][j] += sum[i][j+1]; 
        }
    }
    for(int i = 1; i <= n+1; i++){
        for(int j = 0; j < 2; j++){
            dp[0][i][j] = -1e18;
        }
    }
    dp[0][0][1] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n+1; j++){
            for(int k = 0; k <= n+1; k++){
                long long now = dp[i-1][j][1];
                if(k > j){
                    now += sum[i-1][j]-sum[i-1][k];
                }
                if(j > k){
                    now += sum[i][k]-sum[i][j];
                }

                ans = max(ans,now);
                if(k > j) dp[i][k][1] = max(dp[i][k][1],now);
                else if (k < j){
                    dp[i][k][0] = max(dp[i][k][0],now);
                    now -= dp[i-1][j][1];
                    now += dp[i-1][j][0];
                    ans = max(ans,now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                }
                else{
                    dp[i][k][1] = max(dp[i][k][1],now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                    now -= dp[i-1][j][1];
                    now += dp[i-1][j][0];
                    ans = max(ans,now);
                    dp[i][k][0] = max(dp[i][k][0],now);
                    dp[i][k][1] = max(dp[i][k][1],now);
                }
            }
            dp[i][0][1] = max({dp[i][0][1],dp[i-1][j][1],dp[i-1][j][0]});

        }
    }
    return ans;
    }
    
    mx = *max_element(x.begin(),x.end());
    if(mx <= 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-1][0];
    
            ans2 = max(ans2,ans);
        }
        return ans2;
    }else{
        bool z = 1;
        for(int i = 0; i < n; i++){
            z = (z && (x[i] % 2 == 0));
        }
        if(z){
            long long sum = 0;
            for(int i = 0; i < m; i++) sum += w[i];
            return sum;
        }
        else{
            long long dp[n+2][4][4]{};
    
    vector<pair<int,int>>hv[n+2];
    vector<int>to[n+2];
    for(int i = 0; i < m; i++){
        hv[x[i]+2].push_back({y[i]+1,w[i]});
        to[x[i]+2].push_back(y[i]);    
    }
 
    for(int i = 0; i <= n+1; i++){
        to[i].push_back(0);
        if(i > 1){
            to[i].push_back(n+3);
        }
    }
    long long ans = 0;
    for(int i = 2; i <= n+1; i++){
        int sz = 0;
        for(int j = 0; j < to[i-2].size(); j++){
            for(int k = 0; k < to[i-1].size(); k++){
                for(int v = 0; v < to[i].size(); v++){
                    long long now = dp[i-1][k][j];
                    for(auto nodes : hv[i-1]){
                        if(nodes.first > max(to[i-2][j],to[i-1][k])){
                            if(nodes.first <= to[i][v]){
                                now += nodes.second;
                            }
                        }
                    }
                    for(auto nodes : hv[i]){
                        if(nodes.first > to[i][v]){
                            if(nodes.first <= to[i-1][k]){
                                now += nodes.second;
                            }
                        }
                    }
                    
                    dp[i][v][k] = max(dp[i][v][k],now);
                    ans = max(ans,now);
                    }
                }
            }
        }
        return ans;
        }
    }
}
 
// int main(){
//     cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
// }

컴파일 시 표준 에러 (stderr) 메시지

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:111:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for(int j = 0; j < to[i-2].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~~
fish.cpp:112:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |             for(int k = 0; k < to[i-1].size(); k++){
      |                            ~~^~~~~~~~~~~~~~~~
fish.cpp:113:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |                 for(int v = 0; v < to[i].size(); v++){
      |                                ~~^~~~~~~~~~~~~~
fish.cpp:110:13: warning: unused variable 'sz' [-Wunused-variable]
  110 |         int sz = 0;
      |             ^~

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 0 / 17
• Subtask 7: 14 / 14
• Subtask 8: 0 / 16