# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312444 | ryannguyen0303 | K blocks (IZhO14_blocks) | C++14 | 191 ms | 42848 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 file "test"
#define ll long long
#define X first
#define Y second
typedef pair <int, int> ii;
const int oo = 1e9 + 7;
const int mod = 1e6;
const int N = 100005;
int n, k;
int a[N];
int f[105][N];
void enter()
{
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
}
void solve()
{
memset(f, oo, sizeof f);
f[1][0] = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |