# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117115 | Lawliet | Roller Coaster Railroad (IOI16_railroad) | C++14 | 84 ms | 31112 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>
#include "railroad.h"
#define MAX 20
#define EXP 1024*64 + 10
#define INF 1000000000000000000LL
using namespace std;
typedef long long int lli;
int N;
int S[MAX];
int T[MAX];
lli dp[MAX][EXP];
bool isActive(int i, int mask) { return mask & (1 << i); }
lli cost(int i, int j)//estou no i e vou entrar no j
{
if(S[j] >= T[i]) return 0;
return T[i] - S[j];
}
lli DP(int i, int mask)
{
//printf("i = %d ask = %d\n",i,mask);
if(dp[i][mask] != -1) return dp[i][mask];
# | 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... |