# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666256 | 2022-11-27T21:37:38 Z | Banan | Catfish Farm (IOI22_fish) | C++17 | 43 ms | 10580 KB |
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; #define double long double #define endl '\n' #define sz(a) (int)a.size() #define pb push_back #define fs first #define sc second #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() ll const INF = LONG_LONG_MAX; long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) { vector<int> val(n+3, 0); for(int i=0;i<m;i++) val[x[i]]=w[i]; vector<vector<int>> dp(n+3, vector<int>(3, 0)); dp[0][1]=val[1]; for(int i=1;i<n;i++) { dp[i][0]=max(dp[i-1][0], dp[i-1][1]); dp[i][1]=val[i+1]; if(i==1){dp[i][1]+=max(dp[i-1][0]+val[i-1], dp[i-1][1]-val[i]);} else { dp[i][1]+=max(dp[i-2][0]+val[i-1], max(dp[i-2][1], dp[i-1][1]-val[i])); } } for(int i=0;i<n;i++) cout<<dp[i][0]<<' '; cout<<endl; for(int i=0;i<n;i++) cout<<dp[i][1]<<' '; return max(dp[n-1][0], dp[n-1][1]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 43 ms | 10580 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 216 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 24 ms | 7912 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 24 ms | 7912 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 43 ms | 10580 KB | Possible tampering with the output |
2 | Halted | 0 ms | 0 KB | - |