# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
648400 | bebra | Retro (COCI17_retro) | C++17 | 184 ms | 217868 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>
using namespace std;
#define dbg(x) cerr << #x << ": " << x << endl;
const int INF = 1e9;
const int MAX_N = 300;
const int MAX_BALANCE = 300 / 2 + 5;
char grid[MAX_N][MAX_N];
int dp[MAX_N][MAX_N][MAX_BALANCE];
tuple<int, int, int> p[MAX_N][MAX_N][MAX_BALANCE];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < m; ++j) {
grid[i][j] = s[j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
for (int k = 0; k < MAX_BALANCE; ++k) {
dp[i][j][k] = -INF;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |