oj.uz

답안 #732551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732551 2023-04-29T05:55:22 Z math_rabbit_1028 메기 농장 (IOI22_fish) C++17
18 / 100
 456 ms 84044 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]);
        }
        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();
            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();
            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();
            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();
            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:53: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]
   53 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:60: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]
   60 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:65: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]
   65 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:74: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]
   74 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:77: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]
   77 |             while (l <= ylist[i - 2].size() - 2 && ylist[i - 2][l].first <= j) {
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 35212 KB Output is correct
2 Correct 150 ms 39556 KB Output is correct
3 Correct 40 ms 25420 KB Output is correct
4 Correct 44 ms 25420 KB Output is correct
5 Correct 450 ms 68924 KB Output is correct
6 Correct 456 ms 84044 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9784 KB Output is correct
2 Correct 214 ms 43240 KB Output is correct
3 Correct 250 ms 48936 KB Output is correct
4 Correct 123 ms 35284 KB Output is correct
5 Correct 147 ms 39596 KB Output is correct
6 Correct 6 ms 9744 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9740 KB Output is correct
10 Correct 45 ms 25480 KB Output is correct
11 Correct 41 ms 25344 KB Output is correct
12 Correct 161 ms 35244 KB Output is correct
13 Correct 169 ms 39612 KB Output is correct
14 Correct 133 ms 35724 KB Output is correct
15 Correct 147 ms 36256 KB Output is correct
16 Correct 137 ms 35704 KB Output is correct
17 Correct 147 ms 38492 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 25548 KB Output is correct
2 Correct 44 ms 25432 KB Output is correct
3 Correct 88 ms 32644 KB Output is correct
4 Correct 80 ms 31748 KB Output is correct
5 Correct 139 ms 42216 KB Output is correct
6 Correct 148 ms 42316 KB Output is correct
7 Correct 137 ms 42208 KB Output is correct
8 Correct 143 ms 42320 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 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9800 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9800 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9940 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 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9800 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9800 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9940 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 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9800 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9800 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9812 KB Output is correct
10 Correct 7 ms 10068 KB Output is correct
11 Incorrect 6 ms 9940 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 41 ms 25548 KB Output is correct
2 Correct 44 ms 25432 KB Output is correct
3 Correct 88 ms 32644 KB Output is correct
4 Correct 80 ms 31748 KB Output is correct
5 Correct 139 ms 42216 KB Output is correct
6 Correct 148 ms 42316 KB Output is correct
7 Correct 137 ms 42208 KB Output is correct
8 Correct 143 ms 42320 KB Output is correct
9 Correct 156 ms 51860 KB Output is correct
10 Correct 116 ms 27304 KB Output is correct
11 Correct 219 ms 44788 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 43 ms 25424 KB Output is correct
19 Correct 41 ms 25316 KB Output is correct
20 Correct 41 ms 25344 KB Output is correct
21 Correct 42 ms 25340 KB Output is correct
22 Incorrect 185 ms 45148 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 123 ms 35212 KB Output is correct
2 Correct 150 ms 39556 KB Output is correct
3 Correct 40 ms 25420 KB Output is correct
4 Correct 44 ms 25420 KB Output is correct
5 Correct 450 ms 68924 KB Output is correct
6 Correct 456 ms 84044 KB Output is correct
7 Correct 6 ms 9784 KB Output is correct
8 Correct 214 ms 43240 KB Output is correct
9 Correct 250 ms 48936 KB Output is correct
10 Correct 123 ms 35284 KB Output is correct
11 Correct 147 ms 39596 KB Output is correct
12 Correct 6 ms 9744 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9740 KB Output is correct
16 Correct 45 ms 25480 KB Output is correct
17 Correct 41 ms 25344 KB Output is correct
18 Correct 161 ms 35244 KB Output is correct
19 Correct 169 ms 39612 KB Output is correct
20 Correct 133 ms 35724 KB Output is correct
21 Correct 147 ms 36256 KB Output is correct
22 Correct 137 ms 35704 KB Output is correct
23 Correct 147 ms 38492 KB Output is correct
24 Correct 41 ms 25548 KB Output is correct
25 Correct 44 ms 25432 KB Output is correct
26 Correct 88 ms 32644 KB Output is correct
27 Correct 80 ms 31748 KB Output is correct
28 Correct 139 ms 42216 KB Output is correct
29 Correct 148 ms 42316 KB Output is correct
30 Correct 137 ms 42208 KB Output is correct
31 Correct 143 ms 42320 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 9684 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 6 ms 9800 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 5 ms 9800 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 5 ms 9812 KB Output is correct
41 Correct 7 ms 10068 KB Output is correct
42 Incorrect 6 ms 9940 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278904310545'
43 Halted 0 ms 0 KB -