#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define ff first
#define ss second
long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
vector<vector<pair<int, int>>> a(n);
for (int i = 0; i < m; i++) a[X[i]].emplace_back(Y[i] + 1, W[i]);
vector<vector<pair<int, ll>>> dp(n), dp2(n), pref(n);
for (int x = 0; x < n; x++) {
sort(a[x].begin(), a[x].end());
a[x].emplace_back(n + 1, 0);
ll sum = 0;
for (auto [y, w]: a[x]) {
sum += w;
pref[x].emplace_back(y, sum);
}
}
auto get = [&](int x, int l, int r) -> ll {
if (l > r) return 0;
int i = lower_bound(pref[x].begin(), pref[x].end(), make_pair(l, 0ll)) - pref[x].begin();
int j = lower_bound(pref[x].begin(), pref[x].end(), make_pair(r + 1, 0ll)) - pref[x].begin() - 1;
if (i > j) return 0;
return pref[x][j].ss - (i > 0 ? pref[x][i - 1].ss : 0ll);
};
for (auto [y, w]: a[0]) dp[0].emplace_back(y - 1, 0);
ll ans = 0;
for (int x = 1; x <= 1; x++) {
// cout << '\t' << x << endl;
for (int i = 0; i < a[x].size(); i++) {
a[x][i].ff--;
ll mx = 0, mx2 = 0;
for (int j = 0; j < a[x - 1].size(); j++) {
if (dp[x - 1][j].ff <= a[x][i].ff) {
mx = max(mx, dp[x - 1][j].ss + get(x - 1, dp[x - 1][j].ff + 1, a[x][i].ff));
if (j < dp2[x - 1].size()) mx = max(mx, dp2[x - 1][j].ss);
}
if (dp[x - 1][j].ff >= a[x][i].ff) {
mx2 = max(mx2, dp[x - 1][j].ss + get(x, a[x][i].ff + 1, dp[x - 1][j].ff));
if (j < dp2[x - 1].size()) mx2 = max(mx2, dp2[x - 1][j].ss + get(x, a[x][i].ff + 1, dp[x - 1][j].ff));
}
}
dp[x].emplace_back(a[x][i].ff, mx);
// cout << i << ' ' << a[x][i].ff << ' ' << dp[x].back().ss << endl;
dp2[x].emplace_back(a[x][i].ff, mx2);
ans = max(ans, max(mx, mx2));
a[x][i].ff++;
}
}
return ans;
}
// g++ -o fish -O2 fish.cpp grader.cpp -std=c++17 && .\fish < input.txt > output.txt
Compilation message
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
34 | for (int i = 0; i < a[x].size(); i++) {
| ~~^~~~~~~~~~~~~
fish.cpp:37:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for (int j = 0; j < a[x - 1].size(); j++) {
| ~~^~~~~~~~~~~~~~~~~
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 | if (j < dp2[x - 1].size()) mx = max(mx, dp2[x - 1][j].ss);
| ~~^~~~~~~~~~~~~~~~~~~
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 | if (j < dp2[x - 1].size()) mx2 = max(mx2, dp2[x - 1][j].ss + get(x, a[x][i].ff + 1, dp[x - 1][j].ff));
| ~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
21324 KB |
Output is correct |
| 2 |
Correct |
45 ms |
23888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
15964 KB |
Output is correct |
| 4 |
Correct |
13 ms |
15880 KB |
Output is correct |
| 5 |
Incorrect |
100 ms |
31412 KB |
1st lines differ - on the 1st token, expected: '149814460735479', found: '0' |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
15964 KB |
Output is correct |
| 2 |
Incorrect |
13 ms |
15916 KB |
1st lines differ - on the 1st token, expected: '882019', found: '0' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '3', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '3', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
1st lines differ - on the 1st token, expected: '3', found: '1' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
15964 KB |
Output is correct |
| 2 |
Incorrect |
13 ms |
15916 KB |
1st lines differ - on the 1st token, expected: '882019', found: '0' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
21324 KB |
Output is correct |
| 2 |
Correct |
45 ms |
23888 KB |
Output is correct |
| 3 |
Correct |
13 ms |
15964 KB |
Output is correct |
| 4 |
Correct |
13 ms |
15880 KB |
Output is correct |
| 5 |
Incorrect |
100 ms |
31412 KB |
1st lines differ - on the 1st token, expected: '149814460735479', found: '0' |
| 6 |
Halted |
0 ms |
0 KB |
- |
