| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 656348 |
2022-11-07T01:21:49 Z |
Lobo |
Catfish Farm (IOI22_fish) |
C++17 |
|
1000 ms |
233680 KB |
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
// #define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
const int maxn = 1e5+10;
// const int inf = 1e18+10;
int n, m;
vector<vector<ll>> dp[maxn];
map<int,ll> pf[maxn], pfmx0[maxn], pfmx1[maxn], sfmx0[maxn];
vector<pair<int,int>> fish[maxn]; // fishs from column i
vector<int> hr[maxn]; // important heights from column i, the ones that can be chosen
long long max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
n = N;
m = M;
for(int i = 0; i < m; i++) {
fish[X[i]+1].pb(mp(Y[i]+1,W[i]));
hr[X[i]+1].pb(Y[i]);
}
for(int i = 0; i <= n; i++) {
hr[i].pb(0);
hr[i].pb(n);
sort(all(hr[i]));
sort(all(fish[i]));
hr[i].erase(unique(all(hr[i])),hr[i].end());
// Store only the relevant heights
for(int j = 0; j < hr[i].size(); j++) {
dp[i].pb({0,0});
}
}
for(int i = 1; i <= n; i++) {
for(auto j : hr[i-1]) pf[i][j] = 0;
for(auto j : hr[i]) pf[i][j] = 0;
for(auto j : hr[i+1]) pf[i][j] = 0;
for(auto aux : fish[i]) {
int y = aux.fr;
int w = aux.sc;
pf[i][y]+= w;
}
// Do a prefix sum on the weight of the fishs
pf[i][0] = 0;
for(auto it = next(pf[i].begin()); it != pf[i].end(); it++) {
it->sc+= prev(it)->sc;
}
}
// dp[i][h0][0/1] = until i, with h[i] = hr[i][h0]
// and it's greater/smaller tha the previous
// dp[1][h0][0/1] = 0
for(int h0 = 0; h0 < hr[1].size(); h0++) {
dp[1][h0][0] = 0;
dp[1][h0][1] = 0;
pfmx0[1][hr[1][h0]] = max(pfmx0[1][hr[1][h0]],dp[1][h0][0]-pf[1][hr[1][h0]]);
sfmx0[1][hr[1][h0]] = max(sfmx0[1][hr[1][h0]],dp[1][h0][0]+pf[1+1][hr[1][h0]]);
sfmx0[1][hr[1][h0]] = max(sfmx0[1][hr[1][h0]],dp[1][h0][1]+pf[1+1][hr[1][h0]]);
}
for(auto it = next(pfmx0[1].begin()); it != pfmx0[1].end(); it++) {
it->sc = max(it->sc,prev(it)->sc);
}
auto it = prev(prev(sfmx0[1].end()));
while(true) {
it->sc = max(it->sc,next(it)->sc);
if(it == sfmx0[1].begin()) break;
it = prev(it);
}
for(int i = 2; i <= n; i++) {
for(int h0 = 0; h0 < hr[i].size(); h0++) {
// It's greater than the previous
auto it = prev(upper_bound(all(hr[i-1]),hr[i][h0]));
auto itpf = prev(upper_bound(all(hr[i-1]),hr[i][h0]));
dp[i][h0][0] = pfmx0[i-1][*it] + pf[i-1][*itpf];
if(i != 2) {
it = prev(upper_bound(all(hr[i-2]),hr[i][h0]));
dp[i][h0][0] = max(dp[i][h0][0],pfmx1[i-2][*it] + pf[i-1][hr[i][h0]]);
}
// It's smaller than the previous
it = lower_bound(all(hr[i-1]),hr[i][h0]);
dp[i][h0][1] = sfmx0[i-1][*it] - pf[i][hr[i][h0]];
pfmx0[i][hr[i][h0]] = max(pfmx0[i][hr[i][h0]],dp[i][h0][0]-pf[i][hr[i][h0]]);
pfmx1[i][hr[i][h0]] = max(pfmx1[i][hr[i][h0]],max(dp[i][h0][1],dp[i][h0][0]));
sfmx0[i][hr[i][h0]] = max(sfmx0[i][hr[i][h0]],max(dp[i][h0][0],dp[i][h0][1])+pf[i+1][hr[i][h0]]);
}
for(auto it = next(pfmx0[i].begin()); it != pfmx0[i].end(); it++) {
it->sc = max(it->sc,prev(it)->sc);
}
for(auto it = next(pfmx1[i].begin()); it != pfmx1[i].end(); it++) {
it->sc = max(it->sc,prev(it)->sc);
}
auto it = prev(prev(sfmx0[i].end()));
while(true) {
it->sc = max(it->sc,next(it)->sc);
if(it == sfmx0[i].begin()) break;
it = prev(it);
}
}
ll ans = 0;
for(int h0 = 0; h0 < hr[n].size(); h0++) {
ans = max(ans, dp[n][h0][0]);
ans = max(ans, dp[n][h0][1]);
}
return ans;
}
Compilation message
fish.cpp: In function 'long long int max_weights(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
39 | for(int j = 0; j < hr[i].size(); j++) {
| ~~^~~~~~~~~~~~~~
fish.cpp:65:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for(int h0 = 0; h0 < hr[1].size(); h0++) {
| ~~~^~~~~~~~~~~~~~
fish.cpp:84:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
84 | for(int h0 = 0; h0 < hr[i].size(); h0++) {
| ~~~^~~~~~~~~~~~~~
fish.cpp:118:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
118 | for(int h0 = 0; h0 < hr[n].size(); h0++) {
| ~~~^~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
281 ms |
113276 KB |
Output is correct |
| 2 |
Correct |
344 ms |
125876 KB |
Output is correct |
| 3 |
Correct |
112 ms |
91864 KB |
Output is correct |
| 4 |
Correct |
111 ms |
91784 KB |
Output is correct |
| 5 |
Execution timed out |
1051 ms |
233680 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
26068 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 |
109 ms |
91868 KB |
Output is correct |
| 2 |
Correct |
109 ms |
91784 KB |
Output is correct |
| 3 |
Correct |
171 ms |
91468 KB |
Output is correct |
| 4 |
Correct |
146 ms |
96072 KB |
Output is correct |
| 5 |
Correct |
185 ms |
103500 KB |
Output is correct |
| 6 |
Correct |
178 ms |
103596 KB |
Output is correct |
| 7 |
Correct |
185 ms |
103620 KB |
Output is correct |
| 8 |
Correct |
193 ms |
103528 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
26068 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
26068 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
26068 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
109 ms |
91868 KB |
Output is correct |
| 2 |
Correct |
109 ms |
91784 KB |
Output is correct |
| 3 |
Correct |
171 ms |
91468 KB |
Output is correct |
| 4 |
Correct |
146 ms |
96072 KB |
Output is correct |
| 5 |
Correct |
185 ms |
103500 KB |
Output is correct |
| 6 |
Correct |
178 ms |
103596 KB |
Output is correct |
| 7 |
Correct |
185 ms |
103620 KB |
Output is correct |
| 8 |
Correct |
193 ms |
103528 KB |
Output is correct |
| 9 |
Incorrect |
292 ms |
142740 KB |
1st lines differ - on the 1st token, expected: '99999', found: '74999' |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
281 ms |
113276 KB |
Output is correct |
| 2 |
Correct |
344 ms |
125876 KB |
Output is correct |
| 3 |
Correct |
112 ms |
91864 KB |
Output is correct |
| 4 |
Correct |
111 ms |
91784 KB |
Output is correct |
| 5 |
Execution timed out |
1051 ms |
233680 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
