oj.uz

답안 #732538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732538 2023-04-29T05:32:26 Z math_rabbit_1028 메기 농장 (IOI22_fish) C++17
18 / 100
 439 ms 83908 KB 
#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

long long zero[101010], full[101010];
vector< pair<int, long long> > ylist[101010];
vector< long long > sum[101010], dp[2][101010];

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    for (int i = 0; i < M; i++) {
        X[i] += 1;
        Y[i] += 1;
        ylist[X[i]].push_back({Y[i], 0});
        ylist[X[i] - 1].push_back({Y[i], 0});
        ylist[X[i] + 1].push_back({Y[i], 0});
    }

    for (int i = 0; i <= N + 1; i++) {
        ylist[i].push_back({0, 0});
        ylist[i].push_back({N, 0});
        sort(ylist[i].begin(), ylist[i].end());
        ylist[i].erase(unique(ylist[i].begin(), ylist[i].end()), ylist[i].end());
    }

    for (int i = 0; i < M; i++) {
        int idx = lower_bound(ylist[X[i]].begin(), ylist[X[i]].end(), make_pair(Y[i], 0LL)) - ylist[X[i]].begin();
        ylist[X[i]][idx].second = W[i];
    }

    for (int i = 0; i <= N + 1; i++) {
        sum[i].push_back(0);
        for (int j = 1; j < ylist[i].size(); j++) {
            sum[i].push_back(sum[i].back() + ylist[i][j].second);
        }
    }

    for (int i = 0; i <= N + 1; i++) {
        for (int j = 0; j < ylist[i].size(); j++) dp[0][i].push_back(0);
        for (int j = 0; j < ylist[i].size(); j++) dp[1][i].push_back(0);
    }
    for (int j = 1; j < ylist[0].size() - 1; j++) dp[0][0][j] = -1e18;
    for (int j = 1; j < ylist[0].size() - 1; j++) dp[1][0][j] = -1e18;
    full[0] = -1e18;
    for (int i = 2; i <= N + 1; i++) {
        long long val0 = 0, val1 = 0;
        for (int k = 1; k < ylist[i - 1].size() - 1; k++) {
            int j = lower_bound(ylist[i].begin(), ylist[i].end(), make_pair(ylist[i - 1][k].first, 0LL))
                  - ylist[i].begin();
            val0 = max(val0, dp[0][i - 1][k] - sum[i - 1][k]);
            val1 = max(val1, dp[1][i - 1][k] + sum[i][j]);
        }
        zero[i] = max(val1, max(zero[i - 1], full[i - 1] + sum[i][ylist[i].size() - 1]));
        for (int j = 1; j < ylist[i].size() - 1; j++) {
            dp[1][i][j] = max(dp[1][i][j], val1 - sum[i][j]);
            dp[1][i][j] = max(dp[1][i][j], full[i - 1] + sum[i][ylist[i].size() - 1] - sum[i][j]);
        }

        for (int j = 1; j < ylist[i].size() - 1; j++) {
            int k = lower_bound(ylist[i - 1].begin(), ylist[i - 1].end(), make_pair(ylist[i][j].first, 0LL))
                  - ylist[i - 1].begin();
            assert(k < ylist[i - 1].size());
            dp[0][i][j] = max(dp[0][i][j], val0 + sum[i - 1][k]);
            dp[0][i][j] = max(dp[0][i][j], zero[i - 2] + sum[i - 1][k]);
            dp[0][i][j] = max(dp[0][i][j], full[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
        }
        long long val2 = 0;
        int l = 1;
        for (int j = 1; j < ylist[i].size() - 1; j++) {
            int k = lower_bound(ylist[i - 1].begin(), ylist[i - 1].end(), make_pair(ylist[i][j].first, 0LL))
                  - ylist[i - 1].begin();
            assert(k < ylist[i - 1].size());
            while (l <= ylist[i - 2].size() - 2 && ylist[i - 2][l].first <= j) {
                val2 = max(val2, dp[1][i - 2][l]);
                l++;
            }
            dp[0][i][j] = max(dp[0][i][j], val2 + sum[i - 1][k]);
        }
        long long val3 = 0;
        l = ylist[i - 2].size() - 2;
        for (int j = ylist[i].size() - 1; j >= 1; j--) {
            int k = lower_bound(ylist[i - 1].begin(), ylist[i - 1].end(), make_pair(ylist[i][j].first, 0LL))
                  - ylist[i - 1].begin();
            assert(k < ylist[i - 1].size());
            while (l >= 1 && ylist[i - 2][l].first >= j) {
                val3 = max(val3, dp[1][i - 2][l] + sum[i - 1][k]);
                l--;
            }
            dp[0][i][j] = max(dp[0][i][j], val3);
        }

        full[i] = max(val0 + sum[i - 1][ylist[i - 1].size() - 1], full[i - 1]);
        full[i] = max(full[i], zero[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
        full[i] = max(full[i], full[i - 2] + sum[i - 1][ylist[i - 1].size() - 1]);
        full[i] = max(full[i], val2 + sum[i - 1][ylist[i - 1].size() - 1]);


    }
    long long res = 0;
    res = zero[N + 1];
    return res;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:33:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for (int j = 1; j < ylist[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int j = 0; j < ylist[i].size(); j++) dp[0][i].push_back(0);
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for (int j = 0; j < ylist[i].size(); j++) dp[1][i].push_back(0);
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int j = 1; j < ylist[0].size() - 1; j++) dp[0][0][j] = -1e18;
      |                     ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int j = 1; j < ylist[0].size() - 1; j++) dp[1][0][j] = -1e18;
      |                     ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int k = 1; k < ylist[i - 1].size() - 1; k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:59:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from fish.cpp:2:
fish.cpp:62:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             assert(k < ylist[i - 1].size());
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:69:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from fish.cpp:2:
fish.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             assert(k < ylist[i - 1].size());
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:73:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             while (l <= ylist[i - 2].size() - 2 && ylist[i - 2][l].first <= j) {
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from fish.cpp:2:
fish.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             assert(k < ylist[i - 1].size());
      |                    ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 35272 KB Output is correct
2 Correct 148 ms 39516 KB Output is correct
3 Correct 40 ms 25392 KB Output is correct
4 Correct 43 ms 25384 KB Output is correct
5 Correct 416 ms 68864 KB Output is correct
6 Correct 439 ms 83908 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 209 ms 43244 KB Output is correct
3 Correct 241 ms 52572 KB Output is correct
4 Correct 129 ms 36632 KB Output is correct
5 Correct 143 ms 41316 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9796 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 40 ms 25424 KB Output is correct
11 Correct 40 ms 25320 KB Output is correct
12 Correct 136 ms 36648 KB Output is correct
13 Correct 174 ms 41244 KB Output is correct
14 Correct 129 ms 37168 KB Output is correct
15 Correct 133 ms 37944 KB Output is correct
16 Correct 130 ms 37068 KB Output is correct
17 Correct 144 ms 40048 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 25432 KB Output is correct
2 Correct 46 ms 25420 KB Output is correct
3 Correct 101 ms 32632 KB Output is correct
4 Correct 78 ms 31892 KB Output is correct
5 Correct 143 ms 42204 KB Output is correct
6 Correct 149 ms 42264 KB Output is correct
7 Correct 181 ms 42188 KB Output is correct
8 Correct 146 ms 42304 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9800 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9868 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 7 ms 9936 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278904310545'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9800 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9868 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 7 ms 9936 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278904310545'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9800 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9868 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 7 ms 9936 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278904310545'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 25432 KB Output is correct
2 Correct 46 ms 25420 KB Output is correct
3 Correct 101 ms 32632 KB Output is correct
4 Correct 78 ms 31892 KB Output is correct
5 Correct 143 ms 42204 KB Output is correct
6 Correct 149 ms 42264 KB Output is correct
7 Correct 181 ms 42188 KB Output is correct
8 Correct 146 ms 42304 KB Output is correct
9 Correct 175 ms 51872 KB Output is correct
10 Correct 108 ms 27220 KB Output is correct
11 Correct 267 ms 44780 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9704 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 6 ms 9800 KB Output is correct
16 Correct 5 ms 9792 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 39 ms 25440 KB Output is correct
19 Correct 41 ms 25412 KB Output is correct
20 Correct 54 ms 25344 KB Output is correct
21 Correct 41 ms 25440 KB Output is correct
22 Incorrect 192 ms 47312 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '46051266865719'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 35272 KB Output is correct
2 Correct 148 ms 39516 KB Output is correct
3 Correct 40 ms 25392 KB Output is correct
4 Correct 43 ms 25384 KB Output is correct
5 Correct 416 ms 68864 KB Output is correct
6 Correct 439 ms 83908 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 209 ms 43244 KB Output is correct
9 Correct 241 ms 52572 KB Output is correct
10 Correct 129 ms 36632 KB Output is correct
11 Correct 143 ms 41316 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9796 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9684 KB Output is correct
16 Correct 40 ms 25424 KB Output is correct
17 Correct 40 ms 25320 KB Output is correct
18 Correct 136 ms 36648 KB Output is correct
19 Correct 174 ms 41244 KB Output is correct
20 Correct 129 ms 37168 KB Output is correct
21 Correct 133 ms 37944 KB Output is correct
22 Correct 130 ms 37068 KB Output is correct
23 Correct 144 ms 40048 KB Output is correct
24 Correct 54 ms 25432 KB Output is correct
25 Correct 46 ms 25420 KB Output is correct
26 Correct 101 ms 32632 KB Output is correct
27 Correct 78 ms 31892 KB Output is correct
28 Correct 143 ms 42204 KB Output is correct
29 Correct 149 ms 42264 KB Output is correct
30 Correct 181 ms 42188 KB Output is correct
31 Correct 146 ms 42304 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9684 KB Output is correct
34 Correct 5 ms 9800 KB Output is correct
35 Correct 5 ms 9800 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 6 ms 9684 KB Output is correct
38 Correct 5 ms 9684 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 6 ms 9868 KB Output is correct
41 Correct 7 ms 10068 KB Output is correct
42 Incorrect 7 ms 9936 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278904310545'
43 Halted 0 ms 0 KB -