# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25526 | Bruteforceman | K blocks (IZhO14_blocks) | C++11 | 206 ms | 85760 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;
int a[100010];
long long dp[105][100005];
const long long inf = 1e15;
struct data {
int val;
long long dp, maxn;
data (int val, long long dp, long long maxn) {
this -> val = val;
this -> dp = dp;
this -> maxn = maxn;
}
data () {}
};
long long helpHRSiam(int N, int K, int A[]) {
for(int i = 1; i <= N; i++) {
a[i] = A[i-1];
}
memset(dp, 0, sizeof dp);
dp[0][0] = 0;
for(int i = 1; i <= N; i++) {
dp[0][i] = inf;
}
for(int i = 1; i <= K; i++) {
dp[i][0] = inf;
stack <data> Q;
Compilation message (stderr)
# | 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... |