oj.uz

답안 #732427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732427 2023-04-29T04:07:11 Z math_rabbit_1028 메기 농장 (IOI22_fish) C++17
0 / 100
 1000 ms 49688 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], W[i]});
        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());
        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 = 0; j < ylist[0].size(); j++) dp[0][0].push_back(-1e18);
    for (int j = 0; j < ylist[0].size(); j++) dp[1][0].push_back(-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++) {
            val0 = max(val0, dp[0][i - 1][k] - sum[i - 1][k]);
            val1 = max(val1, dp[1][i - 1][k] + sum[i][k]);
        }

        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 = 0;
        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() && 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() - 1;
        for (int j = N - 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 >= 0 && 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:24: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]
   24 |         for (int j = 1; j < ylist[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:30: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]
   30 |         for (int j = 0; j < ylist[i].size(); j++) dp[0][i].push_back(0);
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:31: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]
   31 |         for (int j = 0; j < ylist[i].size(); j++) dp[1][i].push_back(0);
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:33: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]
   33 |     for (int j = 0; j < ylist[0].size(); j++) dp[0][0].push_back(-1e18);
      |                     ~~^~~~~~~~~~~~~~~~~
fish.cpp:34: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]
   34 |     for (int j = 0; j < ylist[0].size(); j++) dp[1][0].push_back(-1e18);
      |                     ~~^~~~~~~~~~~~~~~~~
fish.cpp:38: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]
   38 |         for (int k = 1; k < ylist[i - 1].size() - 1; k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:44: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]
   44 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:49: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]
   49 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:58: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]
   58 |         for (int j = 1; j < ylist[i].size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:61: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]
   61 |             while (l < ylist[i - 2].size() && ylist[i - 2][l].first <= j) {
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
fish.cpp:70:17: warning: unused variable 'k' [-Wunused-variable]
   70 |             int k = lower_bound(ylist[i - 1].begin(), ylist[i - 1].end(), make_pair(ylist[i][j].first, 0LL))
      |                 ^

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 37492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9684 KB Output is correct
2 Execution timed out 1071 ms 49688 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1063 ms 23940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9688 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9760 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Incorrect 7 ms 9916 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '281680817460236'
10 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 9688 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9760 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Incorrect 7 ms 9916 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '281680817460236'
10 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 9688 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9760 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Incorrect 7 ms 9916 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '281680817460236'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1063 ms 23940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 37492 KB Time limit exceeded
2 Halted 0 ms 0 KB -