Submission #627352

# Submission time Handle Problem Language Result Execution time Memory
627352 2022-08-12T13:31:26 Z _martynas Catfish Farm (IOI22_fish) C++17
0 / 100
48 ms 8104 KB
#include "fish.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using ll = long long;

const int MXN = 3e2+5;

ll A[MXN][MXN];
ll suff[MXN][MXN];
ll dp[MXN][MXN];

ll max_weights(int N, int M, vi X, vi Y, vi W) {
    assert(N <= MXN);
    for(int i = 0; i < M; i++) {
        A[X[i]][Y[i]] = W[i];
    }
    for(int i = 0; i < N; i++) {
        for(int j = N-1; j >= 0; j--) {
            suff[i][j] = suff[i][j+1] + A[i][j];
        }
    }
    for(int i = 1; i < N; i++) {
        for(int j = 0; j <= N; j++) {
            for(int k = 0; k <= N; k++) {
                dp[i][j] = max(dp[i][j], dp[i-1][k]+suff[i-1][k]-min(suff[i-1][k], suff[i-1][j]));
            }
            //cerr << dp[i][j] << " ";
        }
        //cerr << "\n";
    }
    ll ans = 0;
    for(int i = 0; i < N; i++) {
        for(int j = 0; j <= N; j++) {
            ans = max(ans, dp[i][j]+suff[i+1][0]-suff[i+1][j]);
        }
    }
    return ans;
}
/*


*/
# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 4528 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 48 ms 8104 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 4528 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -