oj.uz

답안 #632693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632693 2022-08-20T15:57:02 Z Olympia 메기 농장 (IOI22_fish) C++17
47 / 100
 1000 ms 2097152 KB 
#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]++;
    }
    bool all_even = true;
    for (int i: X) {
        if (i % 2 == 0) {
            all_even = false;
        }
    }
    if (all_even) {
        int64_t w= 0;
        for (int o: W) {
            w += o;
        }
        return w;
    }
    int my = 0;
    for (int y: Y) {
        my = max(my, y);
    }
    my ++;
    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] + 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;
}

Compilation message

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:28:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 3276 KB Output is correct
2 Correct 28 ms 4044 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 83 ms 13356 KB Output is correct
6 Correct 84 ms 13648 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 836 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 26768 KB Output is correct
3 Correct 61 ms 27780 KB Output is correct
4 Correct 53 ms 28984 KB Output is correct
5 Correct 107 ms 32332 KB Output is correct
6 Correct 103 ms 33120 KB Output is correct
7 Correct 104 ms 33624 KB Output is correct
8 Correct 103 ms 33612 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Correct 0 ms 216 KB Output is correct
6 Correct 1 ms 220 KB Output is correct
7 Correct 1 ms 220 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Correct 0 ms 216 KB Output is correct
6 Correct 1 ms 220 KB Output is correct
7 Correct 1 ms 220 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 13 ms 8916 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 37 ms 11420 KB Output is correct
18 Correct 37 ms 11980 KB Output is correct
19 Correct 39 ms 11916 KB Output is correct
20 Correct 36 ms 11848 KB Output is correct
21 Correct 28 ms 7500 KB Output is correct
22 Correct 69 ms 14800 KB Output is correct
23 Correct 20 ms 9384 KB Output is correct
24 Correct 29 ms 10644 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 19 ms 9360 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 1 ms 220 KB Output is correct
5 Correct 0 ms 216 KB Output is correct
6 Correct 1 ms 220 KB Output is correct
7 Correct 1 ms 220 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 13 ms 8916 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 37 ms 11420 KB Output is correct
18 Correct 37 ms 11980 KB Output is correct
19 Correct 39 ms 11916 KB Output is correct
20 Correct 36 ms 11848 KB Output is correct
21 Correct 28 ms 7500 KB Output is correct
22 Correct 69 ms 14800 KB Output is correct
23 Correct 20 ms 9384 KB Output is correct
24 Correct 29 ms 10644 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 19 ms 9360 KB Output is correct
27 Execution timed out 1132 ms 848212 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 26768 KB Output is correct
3 Correct 61 ms 27780 KB Output is correct
4 Correct 53 ms 28984 KB Output is correct
5 Correct 107 ms 32332 KB Output is correct
6 Correct 103 ms 33120 KB Output is correct
7 Correct 104 ms 33624 KB Output is correct
8 Correct 103 ms 33612 KB Output is correct
9 Runtime error 754 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 3276 KB Output is correct
2 Correct 28 ms 4044 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 83 ms 13356 KB Output is correct
6 Correct 84 ms 13648 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Runtime error 836 ms 2097152 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -