| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 701303 | n1k | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define vt vector
#define pb push_back
#define ar array
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size()
using namespace std;
/*
## TAKE IT EASY ##
1. simplify
2. add new elements
3. brute force solution
4. optimize
5. start implementing
*/
// --- templates ---
// --- code ---
const int N = 100'000 + 5;
ll dp[N][2][2];
ll max_weights(int n, int m, vt<int> X, vt<int> Y, vt<int> W){
memset(dp, 0, sizeof dp);
int h = 2;
vt<vt<ll>> a(n + 5, vt<ll>(h));
for(int i = 0; i < m; i++){
a[X[i]][1] = W[i];
}
for(int i = 0; i < n; i++){
for(int h1 = 0; h1 < h; h1++){
for(int h2 = 0; h2 < h; h2++){
for(int h3 = 0; h3 < h; h3++){
if(h2 && h3) continue;
ll l = 0, r = a[i + 1][h3];
if(i == 0){
dp[i][h2][h3] = max(dp[i][h2][h3], r);
}else{
if(!(h1 || h2)){
l = a[i - 1][h3];
}
dp[i][h2][h3] = max(dp[i][h2][h3], l + dp[i - 1][h1][h2] + r);
}
cout << i << " " << dp[i][h2][h3] << endl;
}
}
}
}
ll ans = 0;
for(int h2 = 0; h2 < h; h2++){
for(int h3 = 0; h3 < h; h3++){
ans = max(ans, dp[n - 1][h2][h3]);
}
}
return ans;
}
int main(){
int n, m;
cin >> n >> m;
vt<int> x(m), y(m), w(m);
for(int i = 0; i < m; i++){
cin >> x[i] >> y[i] >> w[i];
}
cout << max_weights(n, m, x, y, w) << endl;
return 0;
}