| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 143692 | tutis | Coins (LMIO19_monetos) | C++17 | 139 ms | 95736 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.
/*input
0 4 1 5
0 0 1 0
0 0 0 1
0 1 1 1
1 1 0 1
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int a[302][302];
int res[302][302];
int k1;
void exact(int n)
{
static int dp[70][70][70 * 70];
for (int i = 0; i < 70; i++)
{
for (int j = 0; j < 70; j++)
{
for (int t = 0; t < 70 * 70; t++)
dp[i][j][t] = -1000000;
}
}
dp[n + 1][n][0] = 0;
for (int i = n; i >= 1; i--)
{
for (int j = 0; j <= n; j++)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||