Submission #732429

#TimeUsernameProblemLanguageResultExecution timeMemory
732429math_rabbit_1028Catfish Farm (IOI22_fish)C++17
0 / 100
1083 ms49716 KiB
#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 (stderr)

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))
      |                 ^
fish.cpp:67:19: warning: unused variable 'val3' [-Wunused-variable]
   67 |         long long val3 = 0;
      |                   ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...