Submission #114590

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
114590	2019-06-02 00:36:54	wilwxk	Roller Coaster Railroad (IOI16_railroad)	C++11	34 / 100	369 ms	335136 KiB

railroad

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MAXN=20;
const ll INF=1e18;
ll dist[MAXN][MAXN];
ll dp[MAXN][(1<<MAXN)];
int n;
 
ll fazdp(int cur, int mask) {
  if(dp[cur][mask]!=-1) return dp[cur][mask];
  dp[cur][mask]=INF;
  for(int viz=0; viz<n; viz++) {
    if(viz==cur) continue;
    if((mask&(1<<viz))==0) continue;
    ll val=fazdp(viz, mask^(1<<cur))+dist[viz][cur];
    dp[cur][mask]=min(dp[cur][mask], val);
  }
  // printf("%d %d >> %lld\n", cur, mask, dp[cur][mask]);
  return dp[cur][mask];
}
 
ll plan_roller_coaster(vector<int> s, vector<int> t) {
  n = (int) s.size();
 
  memset(dp, -1, sizeof(dp));
  for(int i=0; i<n; i++) dp[i][(1<<i)]=0;
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36