#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << ' ';
debug_out(T...);
}
#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
const int maxn = 1e5 + 10;
int n, m, x[maxn], y[maxn], w[maxn];
vector<int> num[maxn];
vector<int> val[maxn];
vector<ll> dp1[maxn], dp2[maxn], sum[maxn];
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
n = N, m = M;
for (int i = 0; i < m; i++){
x[i] = X[i];
y[i] = Y[i];
w[i] = W[i];
num[x[i]].push_back(y[i]-1);
num[x[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++){
num[i].push_back(-1);
num[i].push_back(n-1);
sort(all(num[i]));
num[i].resize(distance(num[i].begin(), unique(all(num[i]))));
for (auto x: num[i]){
val[i].push_back(0);
}
}
for (int i = 0; i < m; i++){
int idx = lower_bound(all(num[x[i]]), y[i]) - num[x[i]].begin();
val[x[i]][idx] = w[i];
}
dp1[0].resize(val[0].size(), 0);
dp2[0].resize(val[0].size(), 0);
sum[0].resize(val[0].size(), 0);
for (int i = 1; i < val[0].size(); i++){
dp1[0][i] = dp1[0][i-1] + val[0][i];
sum[0][i] = sum[0][i-1] + val[0][i];
// debug(0, i, dp1[0][i], dp2[0][i], sum[0][i]);
}
for (int i = 1; i < n; i++){
dp1[i].resize(val[i].size());
dp2[i].resize(val[i].size());
sum[i].resize(val[i].size());
for (int j = 0; j < val[i].size(); j++){
int idx = upper_bound(all(num[i-1]), num[i][j]) - num[i-1].begin() - 1;
dp1[i][j] = dp1[i-1][idx];
if (j){
dp1[i][j] = max(dp1[i][j], dp1[i][j-1] + val[i][j]);
}
if (i > 1){
dp1[i][j] = max(dp1[i][j], dp2[i-1][0]);
dp1[i][j] = max(dp1[i][j], dp2[i-2][0] + sum[i-1][idx]);
}
}
for (int j = val[i].size()-1; ~j; j--){
int idx = lower_bound(all(num[i-1]), num[i][j]) - num[i-1].begin();
dp2[i][j] = dp2[i-1][idx];
if (j + 1 != val[i].size()) dp2[i][j] = max(dp2[i][j], dp2[i][j+1] + val[i][j+1]);
if (i > 2){
dp2[i][j] = max(dp2[i][j], dp1[i-2][val[i-2].size()-1]);
}
}
for (int j = 1; j < val[i].size(); j++){
sum[i][j] = sum[i][j-1] + val[i][j];
}
/*for (int j = 0; j < val[i].size(); j++){
debug(i, j, dp1[i][j], dp2[i][j], sum[i][j]);
}*/
}
ll ans = 0;
for (int i = 0; i < val[n-1].size(); i++){
ans = max(ans, dp2[n-1][i]);
}
return ans;
}
Compilation message
fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:44:13: warning: unused variable 'x' [-Wunused-variable]
44 | for (auto x: num[i]){
| ^
fish.cpp:55:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for (int i = 1; i < val[0].size(); i++){
| ~~^~~~~~~~~~~~~~~
fish.cpp:64:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | for (int j = 0; j < val[i].size(); j++){
| ~~^~~~~~~~~~~~~~~
fish.cpp:78:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
78 | if (j + 1 != val[i].size()) dp2[i][j] = max(dp2[i][j], dp2[i][j+1] + val[i][j+1]);
| ~~~~~~^~~~~~~~~~~~~~~~
fish.cpp:83:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
83 | for (int j = 1; j < val[i].size(); j++){
| ~~^~~~~~~~~~~~~~~
fish.cpp:91:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
91 | for (int i = 0; i < val[n-1].size(); i++){
| ~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
80 ms |
32560 KB |
Output is correct |
| 2 |
Correct |
92 ms |
35216 KB |
Output is correct |
| 3 |
Correct |
37 ms |
27596 KB |
Output is correct |
| 4 |
Correct |
40 ms |
27648 KB |
Output is correct |
| 5 |
Incorrect |
137 ms |
41884 KB |
1st lines differ - on the 1st token, expected: '149814460735479', found: '47459518154495' |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
6 ms |
11988 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
27660 KB |
Output is correct |
| 2 |
Correct |
35 ms |
27660 KB |
Output is correct |
| 3 |
Incorrect |
53 ms |
28492 KB |
1st lines differ - on the 1st token, expected: '21261825233649', found: '20897194550494' |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
6 ms |
12000 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
6 ms |
12000 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
6 ms |
12000 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
27660 KB |
Output is correct |
| 2 |
Correct |
35 ms |
27660 KB |
Output is correct |
| 3 |
Incorrect |
53 ms |
28492 KB |
1st lines differ - on the 1st token, expected: '21261825233649', found: '20897194550494' |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
80 ms |
32560 KB |
Output is correct |
| 2 |
Correct |
92 ms |
35216 KB |
Output is correct |
| 3 |
Correct |
37 ms |
27596 KB |
Output is correct |
| 4 |
Correct |
40 ms |
27648 KB |
Output is correct |
| 5 |
Incorrect |
137 ms |
41884 KB |
1st lines differ - on the 1st token, expected: '149814460735479', found: '47459518154495' |
| 6 |
Halted |
0 ms |
0 KB |
- |
