# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1046845 | Edu175 | Roller Coaster Railroad (IOI16_railroad) | C++17 | 289 ms | 74860 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 <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b;i<ioi;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto dkfjhg:v)cout<<dkfjhg<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MAXN=4e5+5,INF=1e15;
vector<ll> g[MAXN];
ll vis[MAXN];
void dfs(ll x){
vis[x]=1;
for(auto y:g[x])if(!vis[y])dfs(y);
}
long long plan_roller_coaster(std::vector<int> A, std::vector<int> B) {
vector<ll>a,b;
for(auto i:A)a.pb(i);
for(auto i:B)b.pb(i);
if(SZ(a)<=16){
ll n=SZ(a);
vector<vector<ll>>dp(1ll<<n,vector<ll>(n));
fore(mk,1,1ll<<n)fore(x,0,n){
ll &res=dp[mk][x];
# | 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... |