# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634144 | Utaha | Prisoner Challenge (IOI22_prison) | 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 "fish.h"
#include <bits/stdc++.h>
using namespace std;
const int maxN = 305;
int n_col = 0;
const int max_height = maxN;
long long dp[maxN][3][max_height + 1];
long long prefix[maxN][max_height + 1];
const long long INF = 1e18;
const int UP = 0;
const int DOWN = 1;
const int STOP = 2;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
n_col = N + 2;
for(int i = 0; i < M; i++) {
prefix[X[i] + 1][Y[i] + 1] = W[i];
}
for(int i = 0; i < n_col; i++) {
for(int j = 0; j < max_height; j++) {
prefix[i][j + 1] += prefix[i][j];
}
}
// for(int i = 0; i < n_col; i++) {
// for(int j = 0; j < prefix[i].size(); j++) {