# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985342 | Nalrimet | Ljetopica (COI19_ljetopica) | C++17 | 166 ms | 85848 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 <iostream>
#include <vector>
#include <string>
using namespace std;
const int MOD = 1000000007;
int bin_to_int(const string &bin) {
int value = 0;
for (char c : bin) {
value = value * 2 + (c - '0');
}
return value;
}
int add_mod(int a, int b) {
a += b;
if (a >= MOD) a -= MOD;
return a;
}
int calculate_sum(int N, int K, const string &path, int max_value) {
vector<vector<vector<vector<int>>>> dp(N, vector<vector<vector<int>>>(K+1, vector<vector<int>>(2, vector<int>(2, 0))));
dp[0][0][0][0] = 1; // Initial state
for (int i = 0; i < N-1; ++i) {
for (int k = 0; k <= K; ++k) {
for (int smaller = 0; smaller < 2; ++smaller) {
for (int last = 0; last < 2; ++last) {
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... |