# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221186 | emil_physmath | Roller Coaster Railroad (IOI16_railroad) | C++17 | 78 ms | 7296 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 "railroad.h"
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
using uint = unsigned int;
using llong = long long;
const int maxN = 16;
llong dp[maxN + 1][1 << maxN];
inline bool IsSet(uint a, int i) { return a & (1 << i); }
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = s.size();
if (n > maxN)
return -1;
for (uint mask = 1; mask < (1 << n); ++mask)
for (int i = 0; i < n; ++i)
{
if (!IsSet(mask, i)) continue;
uint bit = (1U << i);
uint prev = mask ^ bit;
if (prev == 0)
{
dp[i][mask] = 0;
// cerr << "dp[" << i << "][" << bitset<4>(mask) << "] = " << dp[i][mask] << '\n';
continue;
}
dp[i][mask] = maxN * 1000'000'000LL;
for (int j = 0; j < n; ++j)
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... |