제출 #632830

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632830		Olympia	메기 농장 (IOI22_fish)	C++17	44 / 100	843 ms	2097152 KiB

fish

#include <bits/stdc++.h>
//#include <fish.h>
using namespace std;
int64_t max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for (int i = 0; i < X.size(); i++) {
        X[i]++;
    }
    int my = 0;
    for (int y: Y) {
        my = max(my, y);
    }
    my += 2;
    vector<pair<int,int64_t> > vec[N + 10];
    map<int,int64_t> s[N + 10];
    for (int i = 0; i < X.size(); i++) {
        vec[X[i]].push_back(make_pair(Y[i], W[i]));
        s[X[i]][Y[i]] = W[i];
    }
    int64_t pref[N + 10][my + 2];
    for (int i = 0; i <= N + 9; i++) {
        pref[i][0] = 0;
        for (int j = 1; j <= my + 1; j++) {
            pref[i][j] = pref[i][j - 1];
            if (s[i].count(j - 1)) pref[i][j] += s[i][j - 1];
        }
    }
    int64_t dp[N + 1][my + 1][3];
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= my; j++) {
            for (int d = 0; d < 3; d++) {
                dp[i][j][d] = -1e17;
            }
        }
    }
    dp[0][0][0] = 0;
    //0 --> stagnant
    //1 --> increasing
    //2 --> decreasing
    for (int i = 1; i <= N; i++) {
        for (int p = 0; p <= my; p++) {
            dp[i][0][0] = max(dp[i][0][0], dp[i - 1][p][0]);
        }
        int64_t myMax1 = -1e17;
        int64_t myMax2 = dp[i - 1][0][0] - pref[i - 1][0];
        for (int cur = 1; cur <= my; cur++) {
            dp[i][cur][0] = max(dp[i][cur][0], max(dp[i - 1][cur][1], dp[i - 1][cur][2]));
            myMax1 = max(myMax1, dp[i - 1][cur][1] - pref[i][cur] - pref[i - 1][cur]);
            dp[i][cur][1] = max(dp[i][cur][1], myMax1 + pref[i + 1][cur] + pref[i - 1][cur]);
            for (int d = 1; d <= 2; d++) {
                myMax2 = max(myMax2, dp[i - 1][cur][0] - pref[i - 1][cur]);
                dp[i][cur][d] = max(dp[i][cur][d], myMax2 + pref[i - 1][cur] + pref[i + 1][cur]);
            }
        }
        int64_t myMax3 = -1e17, myMax4 = -1e17;
        for (int cur = my; cur >= 1; cur--) {
            myMax4 = max(myMax4, dp[i - 1][cur][2]);
            dp[i][cur][2] = max(dp[i][cur][2], myMax4 - pref[i][cur] + pref[i + 1][cur]);
            for (int d = 1; d <= 2; d++) {
                myMax3 = max(myMax3, dp[i - 1][cur][0]);
                dp[i][cur][d] = max(dp[i][cur][d], myMax3 + pref[i + 1][cur]);
            }
        }
    }
    int64_t myMax = 0;
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= my; j++) {
            for (int d = 0; d <= 2; d++) {
                myMax = max(myMax, dp[i][j][d]);
            }
        }
    }
    return myMax;
}

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

fish.cpp: In function 'int64_t max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:5:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~
fish.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~

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