# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629479 | 2022-08-14T14:18:26 Z | arnold518 | Catfish Farm (IOI22_fish) | C++17 | 80 ms | 11112 KB |
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 3000; const ll INF = 1e18; int N, M; vector<pii> V[MAXN+10]; ll dp1[MAXN+10][MAXN+10], dp2[MAXN+10][MAXN+10], P[MAXN+10]; 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++) { V[_X[i]+1].push_back({_Y[i]+1, _W[i]}); } for(int i=1; i<=N; i++) { sort(V[i].begin(), V[i].end()); } for(int i=1; i<=N+1; i++) { int t=V[i].size()-1; P[N]=dp1[i-1][N]; for(int j=N-1; j>=0; j--) { int tt=0; if(t>=0 && V[i][t].first==j+1) tt=V[i][t--].second; P[j]=max(P[j+1]+tt, dp1[i-1][j]); } for(int j=0; j<=N; j++) dp1[i][j]=max(dp2[i-1][j], P[j]); ll p=0, q=0; t=0; for(int j=0; j<=N; j++) { int tt=0; if(t<V[i].size() && V[i][t].first==j) tt=V[i][t++].second; p=max(p, dp1[i-1][j]); q+=tt; P[j]=max(P[j], p)+q; } for(int j=0; j<=N; j++) dp2[i][j]=max(dp2[i][j], P[j]); t=0; P[0]=0; for(int j=1; j<=N; j++) { int tt=0; if(t<V[i].size() && V[i][t].first==j) tt=V[i][t++].second; P[j]=max(P[j-1]+tt, dp2[i-1][j]); } for(int j=0; j<=N; j++) dp2[i][j]=max(dp2[i][j], P[j]); } return max(dp1[N+1][0], dp2[N+1][0]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 33 ms | 5952 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Runtime error | 80 ms | 11112 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 468 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Incorrect | 0 ms | 340 KB | 1st lines differ - on the 1st token, expected: '8866', found: '16621' |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Incorrect | 0 ms | 340 KB | 1st lines differ - on the 1st token, expected: '8866', found: '16621' |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Incorrect | 0 ms | 340 KB | 1st lines differ - on the 1st token, expected: '8866', found: '16621' |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 468 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 33 ms | 5952 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |